Recognised as Number
2,328,889
- Positive
- Odd
- Prime
- 7 digits
2,328,889 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,328,889
Digit count7
Digit sum40
Digit product55,296
Multiplicative persistence3times 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,328,889
Distinct prime factors12,328,889
Number of divisors2
Sum of divisors σ(n)2,328,890
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,328,888integers below n that share no factor with it
Carmichael function λ(n)2,328,888the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2,328,8892 in total
Arithmetic
Previous number2,328,888
Next number2,328,890
Double4,657,778
Half1,164,444.5
Square5,423,723,974,321
Cube12,631,251,102,832,459,369
Square root1,526.069788706≈irrational, shown to 9 decimal places
Cube root132.550975995≈
Negation-2,328,889
Reciprocal4.29389292 × 10^-7≈
Representations
Decimal2,328,889
Binary100011100010010011100122 bits
Octal10704471
Hexadecimal238939
Base 361DWZD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and twenty-eight thousand, eight hundred and eighty-nine
Ordinaltwo million, three hundred and twenty-eight thousand, eight hundred and eighty-ninth
Scientific notation2.328889 × 10^6
Engineering notation2.328889 × 10^6
In other bases
Ternary11101022122011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1044011024base 5; one hand: 10 digits
Septenary25536523base 7: 8 digits
Nonary4338564base 9; each digit is two ternary digits: 7 digits
Duodecimal9438a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleb249base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:46:54:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11101100T0T011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001001001100101001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000111000100100111001
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 odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes323 89 39
Gray code1100100100110110100101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000111000100100111001
64-bit0000000000000000000000000000000000000000001000111000100100111001
One's complement11111111110111000111011011000110at 32 bits, every bit flipped
Bits reversed10011100100100011100010000000000at 32 bits
Rotated left by 100000000010001110001001001110010at 32 bits, wrapping
Shifted left by 110001110001001001110010= 4,657,778, no wrap
Shifted right by 1100011100010010011100= 1,164,444, discarding the low bit
These bits as a double1.15062405 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,328,889 to the power 25,423,723,974,321
2,328,889 to the power 312,631,251,102,832,459,369
2,328,889 to the power 429,416,781,749,624,383,467,411,041
2,328,889 to the power 568,508,419,432,100,980,789,035,431,863,449
First ten multiples2,328,889, 4,657,778, 6,986,667, 9,315,556, 11,644,445, 13,973,334, 16,302,223, 18,631,112, 20,960,001, 23,288,890
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1130the total stopping time
Highest value reached9,947,8244× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,328,889 → 6,986,668 → 3,493,334 → 1,746,667 → 5,240,002 → 2,620,001 → 7,860,004 → 3,930,002 → 1,965,001 → 5,895,004 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage232,888,900%
2,328,889% as a decimal23,288.89
2,328,889% of 1002,328,889
2,328,889% of 1,00023,288,890
As a fraction of 1002,328,889/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,328,889
Nerdulate something else
Nothing in mind? Surprise me · today’s page