Number
2,132,001
- Positive
- Odd
- Composite
- 7 digits
2,132,001 is an odd 7-digit integer and a composite number. It has 10 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,132,001
Digit count7
Digit sum9
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 26,321
Distinct prime factors23, 26,321
Number of divisors10
Sum of divisors σ(n)3,184,962
Aliquot sum1,052,961sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,421,280integers below n that share no factor with it
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 26,321, 78,963, 236,889, 710,667, 2,132,00110 in total
Arithmetic
Previous number2,132,000
Next number2,132,002
Double4,264,002
Half1,066,000.5
Square4,545,428,264,001
Cube9,690,857,604,278,396,001
Square root1,460.137322309≈irrational, shown to 9 decimal places
Cube root128.705113331≈
Negation-2,132,001
Reciprocal4.69042932 × 10^-7≈
Representations
Decimal2,132,001
Binary100000100010000010000122 bits
Octal10104041
Hexadecimal208821
Base 3619P29
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and thirty-two thousand and one
Ordinaltwo million, one hundred and thirty-two thousand and first
Scientific notation2.132001 × 10^6
Engineering notation2.132001 × 10^6
Nearest landmarks
Powers & multiples
2,132,001 to the power 24,545,428,264,001
2,132,001 to the power 39,690,857,604,278,396,001
2,132,001 to the power 420,660,918,103,179,144,552,528,001
2,132,001 to the power 544,049,098,056,896,039,365,134,250,660,001
First ten multiples2,132,001, 4,264,002, 6,396,003, 8,528,004, 10,660,005, 12,792,006, 14,924,007, 17,056,008, 19,188,009, 21,320,010
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 9
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1197the total stopping time
Highest value reached6,396,0043× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,132,001 → 6,396,004 → 3,198,002 → 1,599,001 → 4,797,004 → 2,398,502 → 1,199,251 → 3,597,754 → 1,798,877 → 5,396,632 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage213,200,100%
2,132,001% as a decimal21,320.01
2,132,001% of 1002,132,001
2,132,001% of 1,00021,320,010
As a fraction of 1002,132,001/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 2,132,001
Nerdulate something else
Nothing in mind? Surprise me · today’s page