Recognised as Number
2,389,601
- Positive
- Odd
- Composite
- 7 digits
2,389,601 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,389,601
Digit count7
Digit sum29
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation191 × 12,511
Distinct prime factors2191, 12,511
Number of divisors4
Sum of divisors σ(n)2,402,304
Aliquot sum12,703sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,376,900integers below n that share no factor with it
Carmichael function λ(n)237,690the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,376,900
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 191, 12,511, 2,389,6014 in total
Arithmetic
Previous number2,389,600
Next number2,389,602
Double4,779,202
Half1,194,800.5
Square5,710,192,939,201
Cube13,645,082,757,707,648,801
Square root1,545.833432165≈irrational, shown to 9 decimal places
Cube root133.692936907≈
Negation-2,389,601
Reciprocal4.18479905 × 10^-7≈
Representations
Decimal2,389,601
Binary100100011101100110000122 bits
Octal11073141
Hexadecimal247661
Base 361F7TT
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, three hundred and eighty-nine thousand, six hundred and one
Ordinaltwo million, three hundred and eighty-nine thousand, six hundred and first
Scientific notation2.389601 × 10^6
Engineering notation2.389601 × 10^6
In other bases
Ternary11111101220202base 3; the most digit-efficient integer base after e: 14 digits
Quinary1102431401base 5; one hand: 10 digits
Septenary26211524base 7: 8 digits
Nonary4441822base 9; each digit is two ternary digits: 7 digits
Duodecimal972a55base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimaleie01base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:3:46:41base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1111111T0T1T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001011000101110100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001000111011001100001
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
Bytes324 76 61
Gray code1101100100110101010001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001000111011001100001
64-bit0000000000000000000000000000000000000000001001000111011001100001
One's complement11111111110110111000100110011110at 32 bits, every bit flipped
Bits reversed10000110011011100010010000000000at 32 bits
Rotated left by 100000000010010001110110011000010at 32 bits, wrapping
Shifted left by 110010001110110011000010= 4,779,202, no wrap
Shifted right by 1100100011101100110000= 1,194,800, discarding the low bit
These bits as a double1.18061976 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,389,601 to the power 25,710,192,939,201
2,389,601 to the power 313,645,082,757,707,648,801
2,389,601 to the power 432,606,303,402,900,955,282,518,401
2,389,601 to the power 577,916,055,217,875,525,644,061,253,548,001
First ten multiples2,389,601, 4,779,202, 7,168,803, 9,558,404, 11,948,005, 14,337,606, 16,727,207, 19,116,808, 21,506,409, 23,896,010
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 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1161the total stopping time
Highest value reached9,073,0243× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,389,601 → 7,168,804 → 3,584,402 → 1,792,201 → 5,376,604 → 2,688,302 → 1,344,151 → 4,032,454 → 2,016,227 → 6,048,682 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage238,960,100%
2,389,601% as a decimal23,896.01
2,389,601% of 1002,389,601
2,389,601% of 1,00023,896,010
As a fraction of 1002,389,601/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,601
Nerdulate something else
Nothing in mind? Surprise me · today’s page