Recognised as Number
3,166,002
- Positive
- Even
- Composite
- 7 digits
3,166,002 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value3,166,002
Digit count7
Digit sum18
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^2 × 7 × 25,127
Distinct prime factors42, 3, 7, 25,127
Number of divisors24
Sum of divisors σ(n)7,839,936
Aliquot sum4,673,934sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)904,536integers below n that share no factor with it
Carmichael function λ(n)75,378the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 904,536
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 6, 7, 9, 14, 18, 21, 42, 63, 126, 25,127, 50,254, 75,381, 150,762, 175,889, 226,143, 351,778, 452,286, 527,667, 1,055,334, 1,583,001, 3,166,00224 in total
Arithmetic
Previous number3,166,001
Next number3,166,003
Double6,332,004
Half1,583,001
Square10,023,568,664,004
Cube31,734,638,437,373,992,008
Square root1,779.326276994≈irrational, shown to 9 decimal places
Cube root146.837527003≈
Negation-3,166,002
Reciprocal3.1585577 × 10^-7≈
Representations
Decimal3,166,002
Binary110000010011110011001022 bits
Octal14047462
Hexadecimal304F32
Base 361VUWI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthree million, one hundred and sixty-six thousand and two
Ordinalthree million, one hundred and sixty-six thousand and second
Scientific notation3.166002 × 10^6
Engineering notation3.166002 × 10^6
In other bases
Ternary12221211221100base 3; the most digit-efficient integer base after e: 14 digits
Quinary1302303002base 5; one hand: 10 digits
Septenary35624220base 7: 8 digits
Nonary5854840base 9; each digit is two ternary digits: 7 digits
Duodecimal1088216base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimaljff02base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal14:39:26:42base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000T0TT0T1100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100000101001101110110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001100000100111100110010
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
Bytes330 4f 32
Gray code1010000110100010101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001100000100111100110010
64-bit0000000000000000000000000000000000000000001100000100111100110010
One's complement11111111110011111011000011001101at 32 bits, every bit flipped
Bits reversed01001100111100100000110000000000at 32 bits
Rotated left by 100000000011000001001111001100100at 32 bits, wrapping
Shifted left by 111000001001111001100100= 6,332,004, no wrap
Shifted right by 1110000010011110011001= 1,583,001, discarding the low bit
These bits as a double1.56421282 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
3,166,002 to the power 210,023,568,664,004
3,166,002 to the power 331,734,638,437,373,992,008
3,166,002 to the power 4100,471,928,762,002,933,445,312,016
3,166,002 to the power 5318,094,327,404,358,811,293,724,733,280,032
First ten multiples3,166,002, 6,332,004, 9,498,006, 12,664,008, 15,830,010, 18,996,012, 22,162,014, 25,328,016, 28,494,018, 31,660,020
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6Yes
Divisible by 7Yes
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 6
Divisible by 100No, remainder 2
Collatz (3n + 1) trajectory
Steps to reach 171the total stopping time
Highest value reached5,342,6321× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps3,166,002 → 1,583,001 → 4,749,004 → 2,374,502 → 1,187,251 → 3,561,754 → 1,780,877 → 5,342,632 → 2,671,316 → 1,335,658 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage316,600,200%
3,166,002% as a decimal31,660.02
3,166,002% of 1003,166,002
3,166,002% of 1,00031,660,020
As a fraction of 1003,166,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,166,002
Nerdulate something else
Nothing in mind? Surprise me · today’s page