Recognised as Number
2,389,873
- Positive
- Odd
- Prime
- 7 digits
2,389,873 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,389,873
Digit count7
Digit sum40
Digit product72,576
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,389,873
Distinct prime factors12,389,873
Number of divisors2
Sum of divisors σ(n)2,389,874
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,389,872integers below n that share no factor with it
Carmichael function λ(n)2,389,872the 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,389,8732 in total
Arithmetic
Previous number2,389,872
Next number2,389,874
Double4,779,746
Half1,194,936.5
Square5,711,492,956,129
Cube13,649,742,805,542,881,617
Square root1,545.921408093≈irrational, shown to 9 decimal places
Cube root133.698009315≈
Negation-2,389,873
Reciprocal4.18432277 × 10^-7≈
Representations
Decimal2,389,873
Binary100100011101110111000122 bits
Octal11073561
Hexadecimal247771
Base 361F81D
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and eighty-nine thousand, eight hundred and seventy-three
Ordinaltwo million, three hundred and eighty-nine thousand, eight hundred and seventy-third
Scientific notation2.389873 × 10^6
Engineering notation2.389873 × 10^6
In other bases
Ternary11111102021211base 3; the most digit-efficient integer base after e: 14 digits
Quinary1102433443base 5; one hand: 10 digits
Septenary26212363base 7: 8 digits
Nonary4442254base 9; each digit is two ternary digits: 7 digits
Duodecimal973041base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleieddbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:3:51:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1111111T10TT11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011000100010110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000111011101110001
Bit length22 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits10within that length
Bit parityeven12 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
Bytes324 77 71
Gray code1101100100110011001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000111011101110001
64-bit0000000000000000000000000000000000000000001001000111011101110001
One's complement11111111110110111000100010001110at 32 bits, every bit flipped
Bits reversed10001110111011100010010000000000at 32 bits
Rotated left by 100000000010010001110111011100010at 32 bits, wrapping
Shifted left by 110010001110111011100010= 4,779,746, no wrap
Shifted right by 1100100011101110111000= 1,194,936, discarding the low bit
These bits as a double1.18075415 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,389,873 to the power 25,711,492,956,129
2,389,873 to the power 313,649,742,805,542,881,617
2,389,873 to the power 432,621,151,787,911,183,118,664,641
2,389,873 to the power 577,960,409,886,830,662,933,352,421,580,593
First ten multiples2,389,873, 4,779,746, 7,169,619, 9,559,492, 11,949,365, 14,339,238, 16,729,111, 19,118,984, 21,508,857, 23,898,730
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 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73
Collatz (3n + 1) trajectory
Steps to reach 1117the total stopping time
Highest value reached7,169,6203× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,389,873 → 7,169,620 → 3,584,810 → 1,792,405 → 5,377,216 → 2,688,608 → 1,344,304 → 672,152 → 336,076 → 168,038 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage238,987,300%
2,389,873% as a decimal23,898.73
2,389,873% of 1002,389,873
2,389,873% of 1,00023,898,730
As a fraction of 1002,389,873/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,389,873
Nerdulate something else
Nothing in mind? Surprise me · today’s page