Recognised as Number
2,004,667
- Positive
- Odd
- Composite
- 7 digits
2,004,667 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,004,667
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation7 × 286,381
Distinct prime factors27, 286,381
Number of divisors4
Sum of divisors σ(n)2,291,056
Aliquot sum286,389sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,718,280integers below n that share no factor with it
Carmichael function λ(n)286,380the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,718,280
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 7, 286,381, 2,004,6674 in total
Arithmetic
Previous number2,004,666
Next number2,004,668
Double4,009,334
Half1,002,333.5
Square4,018,689,780,889
Cube8,056,134,786,985,408,963
Square root1,415.86263458≈irrational, shown to 9 decimal places
Cube root126.090029719≈
Negation-2,004,667
Reciprocal4.98835966 × 10^-7≈
Representations
Decimal2,004,667
Binary11110100101101011101121 bits
Octal7513273
Hexadecimal1E96BB
Base 3616YT7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four thousand, six hundred and sixty-seven
Ordinaltwo million, four thousand, six hundred and sixty-seventh
Scientific notation2.004667 × 10^6
Engineering notation2.004667 × 10^6
In other bases
Ternary10202211212221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003122132base 5; one hand: 10 digits
Septenary23016340base 7: 8 digits
Nonary3684787base 9; each digit is two ternary digits: 7 digits
Duodecimal808137base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcabd7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:16:51:7base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T100TT0T00T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110101111001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101001011010111011
Bit length21 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits7within that length
Bit parityeven14 set bits, so even; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes31e 96 bb
Gray code100011101110111100110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101001011010111011
64-bit0000000000000000000000000000000000000000000111101001011010111011
One's complement11111111111000010110100101000100at 32 bits, every bit flipped
Bits reversed11011101011010010111100000000000at 32 bits
Rotated left by 100000000001111010010110101110110at 32 bits, wrapping
Shifted left by 11111010010110101110110= 4,009,334, no wrap
Shifted right by 111110100101101011101= 1,002,333, discarding the low bit
These bits as a double9.90437096 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,004,667 to the power 24,018,689,780,889
2,004,667 to the power 38,056,134,786,985,408,963
2,004,667 to the power 416,149,867,555,021,678,829,630,321
2,004,667 to the power 532,375,106,541,922,643,834,358,526,708,107
First ten multiples2,004,667, 4,009,334, 6,014,001, 8,018,668, 10,023,335, 12,028,002, 14,032,669, 16,037,336, 18,042,003, 20,046,670
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1114the total stopping time
Highest value reached10,148,6325× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,004,667 → 6,014,002 → 3,007,001 → 9,021,004 → 4,510,502 → 2,255,251 → 6,765,754 → 3,382,877 → 10,148,632 → 5,074,316 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,466,700%
2,004,667% as a decimal20,046.67
2,004,667% of 1002,004,667
2,004,667% of 1,00020,046,670
As a fraction of 1002,004,667/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,004,667
Nerdulate something else
Nothing in mind? Surprise me · today’s page