Number 133721

Odd Composite Positive

one hundred and thirty-three thousand seven hundred and twenty-one

« 133720 133722 »

Basic Properties

Value133721
In Wordsone hundred and thirty-three thousand seven hundred and twenty-one
Absolute Value133721
SignPositive (+)
Is EvenNo
Is OddYes
Is PrimeNo
Is CompositeYes
Is Perfect SquareNo
Is Perfect CubeNo
Is Power of 2No
Square (n²)17881305841
Cube (n³)2391106098364361
Reciprocal (1/n)7.478256968E-06

Factors & Divisors

Factors 1 7 49 2729 19103 133721
Number of Divisors6
Sum of Proper Divisors21889
Prime Factorization 7 × 7 × 2729
Is Perfect NumberNo
Is AbundantNo
Is DeficientYes

Number Theory

Digit Sum17
Digital Root8
Number of Digits6
Is PalindromeNo
Is Armstrong NumberNo
Is Harshad NumberNo
Is Fibonacci NumberNo
Collatz Steps to 1118
Next Prime 133723
Previous Prime 133717

Trigonometric Functions

sin(133721)0.7778893574
cos(133721)-0.6284012632
tan(133721)-1.237886368
arctan(133721)1.570788849
sinh(133721)
cosh(133721)
tanh(133721)1

Roots & Logarithms

Square Root365.6788208
Cube Root51.13675969
Natural Logarithm (ln)11.80351082
Log Base 105.126199616
Log Base 217.02886652

Number Base Conversions

Binary (Base 2)100000101001011001
Octal (Base 8)405131
Hexadecimal (Base 16)20A59
Base64MTMzNzIx

Cryptographic Hashes

MD5229f02bf7dc458503fc85c734e4ed690
SHA-11e679b5b8f21c552a27b146ca5d36ebbaec7c932
SHA-25668fb4ac74ad6d56b35364f6c8384a8d3e03104b9737d6fee56f818286642d1af
SHA-512a44bb8b763f413d401eb74ab35e3eec62fae1a37f8711e9eef1b9de15bd20cc262b1b78211ca8b93effbd0d96f9ee2aed8bc5a67aa21ce9c4f0310df754414e9

Initialize 133721 in Different Programming Languages

LanguageCode
C#int number = 133721;
C/C++int number = 133721;
Javaint number = 133721;
JavaScriptconst number = 133721;
TypeScriptconst number: number = 133721;
Pythonnumber = 133721
Rubynumber = 133721
PHP$number = 133721;
Govar number int = 133721
Rustlet number: i32 = 133721;
Swiftlet number = 133721
Kotlinval number: Int = 133721
Scalaval number: Int = 133721
Dartint number = 133721;
Rnumber <- 133721L
MATLABnumber = 133721;
Lualocal number = 133721
Perlmy $number = 133721;
Haskellnumber :: Int number = 133721
Elixirnumber = 133721
Clojure(def number 133721)
F#let number = 133721
Visual BasicDim number As Integer = 133721
Pascal/Delphivar number: Integer = 133721;
SQLDECLARE @number INT = 133721;
Bashnumber=133721
PowerShell$number = 133721

Fun Facts about 133721

  • The number 133721 is one hundred and thirty-three thousand seven hundred and twenty-one.
  • 133721 is an odd number.
  • 133721 is a composite number with 6 divisors.
  • 133721 is a deficient number — the sum of its proper divisors (21889) is less than it.
  • The digit sum of 133721 is 17, and its digital root is 8.
  • The prime factorization of 133721 is 7 × 7 × 2729.
  • Starting from 133721, the Collatz sequence reaches 1 in 118 steps.
  • In binary, 133721 is 100000101001011001.
  • In hexadecimal, 133721 is 20A59.

About the Number 133721

Overview

The number 133721, spelled out as one hundred and thirty-three thousand seven hundred and twenty-one, is an odd positive integer. In mathematics, every integer has a unique set of properties that define its role in arithmetic, algebra, and number theory. On this page we explore everything there is to know about the number 133721 — from its divisibility and prime factorization to its trigonometric values, binary representation, and cryptographic hashes.

Parity and Sign

The number 133721 is odd, which means it leaves a remainder of 1 when divided by 2. Odd numbers have distinct properties in modular arithmetic and appear frequently in number theory, combinatorics, and cryptography.As a positive number, 133721 lies to the right of zero on the number line. Its absolute value is 133721.

Primality and Factorization

133721 is a composite number, meaning it has divisors other than 1 and itself. Specifically, 133721 has 6 divisors: 1, 7, 49, 2729, 19103, 133721. The sum of its proper divisors (all divisors except 133721 itself) is 21889, which makes 133721 a deficient number, since 21889 < 133721. Most integers are deficient — the sum of their proper divisors falls short of the number itself.

The prime factorization of 133721 is 7 × 7 × 2729. Prime factorization is essential for computing the greatest common divisor (GCD) and least common multiple (LCM), simplifying fractions, and solving problems in modular arithmetic. The nearest primes to 133721 are 133717 and 133723.

Special Classifications

Beyond basic primality, number theorists have identified many special categories that a number can belong to. The number 133721 does not belong to any of the classical special categories (perfect square, Fibonacci, palindrome, Armstrong, or Harshad), but it still possesses a unique combination of mathematical properties that distinguishes it from every other integer.

Digit Properties

The digits of 133721 sum to 17, and its digital root (the single-digit value obtained by repeatedly summing digits) is 8. The number 133721 has 6 digits in its decimal representation. Digit sums are fundamental to divisibility tests: a number is divisible by 3 if and only if its digit sum is divisible by 3, and the same holds for divisibility by 9. The digital root, also known as the repeated digital sum, has applications in casting out nines — a centuries-old technique for verifying arithmetic calculations.

Number Base Conversions

In the binary (base-2) number system, 133721 is represented as 100000101001011001. Binary is the language of digital computers — every file, image, video, and program is ultimately stored as a sequence of binary digits (bits). In octal (base-8), 133721 is 405131, a system historically used in computing because each octal digit corresponds to exactly three binary digits. In hexadecimal (base-16), 133721 is 20A59 — hex is ubiquitous in programming for representing memory addresses, color codes (#FF5733), and byte values.

The Base64 encoding of the string “133721” is MTMzNzIx. Base64 is widely used in web development for encoding binary data in URLs, email attachments (MIME), JSON Web Tokens (JWT), and data URIs in HTML and CSS.

Mathematical Functions

The square of 133721 is 17881305841 (i.e. 133721²), and its square root is approximately 365.678821. The cube of 133721 is 2391106098364361, and its cube root is approximately 51.136760. The reciprocal (1/133721) is 7.478256968E-06.

The natural logarithm (ln) of 133721 is 11.803511, the base-10 logarithm is 5.126200, and the base-2 logarithm is 17.028867. Logarithms are essential in measuring earthquake magnitudes (Richter scale), sound levels (decibels), acidity (pH), and information content (bits).

Trigonometry

Treating 133721 as an angle in radians, the principal trigonometric functions yield: sin(133721) = 0.7778893574, cos(133721) = -0.6284012632, and tan(133721) = -1.237886368. The hyperbolic functions give: sinh(133721) = ∞, cosh(133721) = ∞, and tanh(133721) = 1. Trigonometric functions are indispensable in physics (wave motion, oscillations, alternating current), engineering (signal processing, structural analysis), computer graphics (rotations, projections), and navigation (GPS, celestial mechanics).

Cryptographic Hashes

When the string “133721” is passed through standard cryptographic hash functions, the results are: MD5: 229f02bf7dc458503fc85c734e4ed690, SHA-1: 1e679b5b8f21c552a27b146ca5d36ebbaec7c932, SHA-256: 68fb4ac74ad6d56b35364f6c8384a8d3e03104b9737d6fee56f818286642d1af, and SHA-512: a44bb8b763f413d401eb74ab35e3eec62fae1a37f8711e9eef1b9de15bd20cc262b1b78211ca8b93effbd0d96f9ee2aed8bc5a67aa21ce9c4f0310df754414e9. Cryptographic hashes are one-way functions that produce a fixed-size output from any input. They are used for data integrity verification (detecting file corruption or tampering), password storage (storing hashes instead of plaintext passwords), digital signatures, blockchain technology (Bitcoin uses SHA-256), and content addressing (Git uses SHA-1 to identify objects).

Collatz Conjecture

The Collatz conjecture (also known as the 3n + 1 problem) is one of the most famous unsolved problems in mathematics. Starting from 133721 and repeatedly applying the rule — divide by 2 if even, multiply by 3 and add 1 if odd — the sequence reaches 1 in 118 steps. Despite its simplicity, no one has been able to prove that this process always terminates for every starting number, and the conjecture remains open since it was first proposed by Lothar Collatz in 1937.

Programming

In software development, the number 133721 can be represented across dozens of programming languages. For example, in C# you would write int number = 133721;, in Python simply number = 133721, in JavaScript as const number = 133721;, and in Rust as let number: i32 = 133721;. Math.Number provides initialization code for 27 programming languages, making it a handy quick-reference for developers working across different technology stacks.

Related Numbers

Nearby Numbers