Recognised as Number
2,004,669
- Positive
- Odd
- Composite
- 7 digits
2,004,669 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,004,669
Digit count7
Digit sum27
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 numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 24,749
Distinct prime factors23, 24,749
Number of divisors10
Sum of divisors σ(n)2,994,750
Aliquot sum990,081sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,336,392integers below n that share no factor with it
Carmichael function λ(n)668,196the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,336,392
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 24,749, 74,247, 222,741, 668,223, 2,004,66910 in total
Arithmetic
Previous number2,004,668
Next number2,004,670
Double4,009,338
Half1,002,334.5
Square4,018,697,799,561
Cube8,056,158,899,148,150,309
Square root1,415.863340863≈irrational, shown to 9 decimal places
Cube root126.090071651≈
Negation-2,004,669
Reciprocal4.98835469 × 10^-7≈
Representations
Decimal2,004,669
Binary11110100101101011110121 bits
Octal7513275
Hexadecimal1E96BD
Base 3616YT9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four thousand, six hundred and sixty-nine
Ordinaltwo million, four thousand, six hundred and sixty-ninth
Scientific notation2.004669 × 10^6
Engineering notation2.004669 × 10^6
In other bases
Ternary10202211220000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1003122134base 5; one hand: 10 digits
Septenary23016342base 7: 8 digits
Nonary3684800base 9; each digit is two ternary digits: 7 digits
Duodecimal808139base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalcabd9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:16:51:9base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11T100TT0T0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000111110101111001101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000111101001011010111101
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 bd
Gray code100011101110111100011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000111101001011010111101
64-bit0000000000000000000000000000000000000000000111101001011010111101
One's complement11111111111000010110100101000010at 32 bits, every bit flipped
Bits reversed10111101011010010111100000000000at 32 bits
Rotated left by 100000000001111010010110101111010at 32 bits, wrapping
Shifted left by 11111010010110101111010= 4,009,338, no wrap
Shifted right by 111110100101101011110= 1,002,334, discarding the low bit
These bits as a double9.90438084 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,004,669 to the power 24,018,697,799,561
2,004,669 to the power 38,056,158,899,148,150,309
2,004,669 to the power 416,149,932,004,196,423,331,792,721
2,004,669 to the power 532,375,268,040,920,439,764,121,582,214,349
First ten multiples2,004,669, 4,009,338, 6,014,007, 8,018,676, 10,023,345, 12,028,014, 14,032,683, 16,037,352, 18,042,021, 20,046,690
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
Collatz (3n + 1) trajectory
Steps to reach 1114the total stopping time
Highest value reached6,014,0083× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,004,669 → 6,014,008 → 3,007,004 → 1,503,502 → 751,751 → 2,255,254 → 1,127,627 → 3,382,882 → 1,691,441 → 5,074,324 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage200,466,900%
2,004,669% as a decimal20,046.69
2,004,669% of 1002,004,669
2,004,669% of 1,00020,046,690
As a fraction of 1002,004,669/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,669
Nerdulate something else
Nothing in mind? Surprise me · today’s page