Recognised as Number
3,032,002
- Positive
- Even
- Composite
- 7 digits
3,032,002 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,032,002
Digit count7
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 37 × 40,973
Distinct prime factors32, 37, 40,973
Number of divisors8
Sum of divisors σ(n)4,671,036
Aliquot sum1,639,034sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,474,992integers below n that share no factor with it
Carmichael function λ(n)368,748the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,474,992
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 37, 74, 40,973, 81,946, 1,516,001, 3,032,0028 in total
Arithmetic
Previous number3,032,001
Next number3,032,003
Double6,064,004
Half1,516,001
Square9,193,036,128,004
Cube27,873,303,926,180,384,008
Square root1,741.26448307≈irrational, shown to 9 decimal places
Cube root144.735976142≈
Negation-3,032,002
Reciprocal3.29815086 × 10^-7≈
Representations
Decimal3,032,002
Binary101110010000111100001022 bits
Octal13441702
Hexadecimal2E43C2
Base 361SZIA
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, thirty-two thousand and two
Ordinalthree million, thirty-two thousand and second
Scientific notation3.032002 × 10^6
Engineering notation3.032002 × 10^6
In other bases
Ternary12201001010101base 3; the most digit-efficient integer base after e: 14 digits
Quinary1234011002base 5; one hand: 10 digits
Septenary34525441base 7: 8 digits
Nonary5631111base 9; each digit is two ternary digits: 7 digits
Duodecimal102276abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimalij002base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:2:13:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T01001010101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100100100010011000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011100100001111000010
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes32e 43 c2
Gray code1110010110001000100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011100100001111000010
64-bit0000000000000000000000000000000000000000001011100100001111000010
One's complement11111111110100011011110000111101at 32 bits, every bit flipped
Bits reversed01000011110000100111010000000000at 32 bits
Rotated left by 100000000010111001000011110000100at 32 bits, wrapping
Shifted left by 110111001000011110000100= 6,064,004, no wrap
Shifted right by 1101110010000111100001= 1,516,001, discarding the low bit
These bits as a double1.49800803 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,032,002 to the power 29,193,036,128,004
3,032,002 to the power 327,873,303,926,180,384,008
3,032,002 to the power 484,511,913,250,786,776,673,024,016
3,032,002 to the power 5256,240,290,000,212,008,446,162,162,560,032
First ten multiples3,032,002, 6,064,004, 9,096,006, 12,128,008, 15,160,010, 18,192,012, 21,224,014, 24,256,016, 27,288,018, 30,320,020
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
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 1
Divisible by 8No, remainder 2
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 6
Divisible by 12No, remainder 10
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 1226the total stopping time
Highest value reached8,634,1122× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,032,002 → 1,516,001 → 4,548,004 → 2,274,002 → 1,137,001 → 3,411,004 → 1,705,502 → 852,751 → 2,558,254 → 1,279,127 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage303,200,200%
3,032,002% as a decimal30,320.02
3,032,002% of 1003,032,002
3,032,002% of 1,00030,320,020
As a fraction of 1003,032,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 3,032,002
Nerdulate something else
Nothing in mind? Surprise me · today’s page