Recognised as Number
1,532,002
- Positive
- Even
- Composite
- 7 digits
1,532,002 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,532,002
Digit count7
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 337 × 2,273
Distinct prime factors32, 337, 2,273
Number of divisors8
Sum of divisors σ(n)2,305,836
Aliquot sum773,834sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)763,392integers below n that share no factor with it
Carmichael function λ(n)47,712the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 763,392
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 337, 674, 2,273, 4,546, 766,001, 1,532,0028 in total
Arithmetic
Previous number1,532,001
Next number1,532,003
Double3,064,004
Half766,001
Square2,347,030,128,004
Cube3,595,654,850,162,384,008
Square root1,237.740683665≈irrational, shown to 9 decimal places
Cube root115.279772502≈
Negation-1,532,002
Reciprocal6.52740662 × 10^-7≈
Representations
Decimal1,532,002
Binary10111011000000110001021 bits
Octal5660142
Hexadecimal176062
Base 36WU3M
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, five hundred and thirty-two thousand and two
Ordinalone million, five hundred and thirty-two thousand and second
Scientific notation1.532002 × 10^6
Engineering notation1.532002 × 10^6
In other bases
Ternary2212211111211base 3; the most digit-efficient integer base after e: 13 digits
Quinary343011002base 5; one hand: 9 digits
Septenary16010323base 7: 8 digits
Nonary2784454base 9; each digit is two ternary digits: 7 digits
Duodecimal61a6aabase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal9ba02base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal7:5:33:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary100T00TTTTTT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010001010000110100110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000101110110000001100010
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes317 60 62
Gray code111001101000001010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000101110110000001100010
64-bit0000000000000000000000000000000000000000000101110110000001100010
One's complement11111111111010001001111110011101at 32 bits, every bit flipped
Bits reversed01000110000001101110100000000000at 32 bits
Rotated left by 100000000001011101100000011000100at 32 bits, wrapping
Shifted left by 11011101100000011000100= 3,064,004, no wrap
Shifted right by 110111011000000110001= 766,001, discarding the low bit
These bits as a double7.56909558 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,532,002 to the power 22,347,030,128,004
1,532,002 to the power 33,595,654,850,162,384,008
1,532,002 to the power 45,508,550,421,758,472,625,024,016
1,532,002 to the power 58,439,110,263,234,823,578,482,042,560,032
First ten multiples1,532,002, 3,064,004, 4,596,006, 6,128,008, 7,660,010, 9,192,012, 10,724,014, 12,256,016, 13,788,018, 15,320,020
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9No, remainder 4
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 10
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1101the total stopping time
Highest value reached2,298,0041× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,532,002 → 766,001 → 2,298,004 → 1,149,002 → 574,501 → 1,723,504 → 861,752 → 430,876 → 215,438 → 107,719 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage153,200,200%
1,532,002% as a decimal15,320.02
1,532,002% of 1001,532,002
1,532,002% of 1,00015,320,020
As a fraction of 1001,532,002/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 1,532,002
Nerdulate something else
Nothing in mind? Surprise me · today’s page