Recognised as Number
2,425,159
- Positive
- Odd
- Composite
- 7 digits
2,425,159 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,425,159
Digit count7
Digit sum28
Digit product3,600
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation11 × 220,469
Distinct prime factors211, 220,469
Number of divisors4
Sum of divisors σ(n)2,645,640
Aliquot sum220,481sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,204,680integers below n that share no factor with it
Carmichael function λ(n)1,102,340the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 2,204,680
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 11, 220,469, 2,425,1594 in total
Arithmetic
Previous number2,425,158
Next number2,425,160
Double4,850,318
Half1,212,579.5
Square5,881,396,175,281
Cube14,263,320,867,048,294,679
Square root1,557.292201226≈irrational, shown to 9 decimal places
Cube root134.352805348≈
Negation-2,425,159
Reciprocal4.12344098 × 10^-7≈
Representations
Decimal2,425,159
Binary100101000000010100011122 bits
Octal11200507
Hexadecimal250147
Base 361FZ9J
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and twenty-five thousand, one hundred and fifty-nine
Ordinaltwo million, four hundred and twenty-five thousand, one hundred and fifty-ninth
Scientific notation2.425159 × 10^6
Engineering notation2.425159 × 10^6
In other bases
Ternary11120012200201base 3; the most digit-efficient integer base after e: 14 digits
Quinary1110101114base 5; one hand: 10 digits
Septenary26420302base 7: 8 digits
Nonary4505621base 9; each digit is two ternary digits: 7 digits
Duodecimal98b547base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf32hjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:13:39:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT01T0T01T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010000000101011011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010000000101000111
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 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
Bytes325 01 47
Gray code1101111000000111100100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010000000101000111
64-bit0000000000000000000000000000000000000000001001010000000101000111
One's complement11111111110110101111111010111000at 32 bits, every bit flipped
Bits reversed11100010100000001010010000000000at 32 bits
Rotated left by 100000000010010100000001010001110at 32 bits, wrapping
Shifted left by 110010100000001010001110= 4,850,318, no wrap
Shifted right by 1100101000000010100011= 1,212,579, discarding the low bit
These bits as a double1.19818775 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,425,159 to the power 25,881,396,175,281
2,425,159 to the power 314,263,320,867,048,294,679
2,425,159 to the power 434,590,820,970,609,975,275,428,961
2,425,159 to the power 583,888,240,794,263,517,028,984,023,629,799
First ten multiples2,425,159, 4,850,318, 7,275,477, 9,700,636, 12,125,795, 14,550,954, 16,976,113, 19,401,272, 21,826,431, 24,251,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11Yes
Divisible by 12No, remainder 7
Divisible by 100No, remainder 59
Collatz (3n + 1) trajectory
Steps to reach 1117the total stopping time
Highest value reached448,015,696184× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,425,159 → 7,275,478 → 3,637,739 → 10,913,218 → 5,456,609 → 16,369,828 → 8,184,914 → 4,092,457 → 12,277,372 → 6,138,686 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage242,515,900%
2,425,159% as a decimal24,251.59
2,425,159% of 1002,425,159
2,425,159% of 1,00024,251,590
As a fraction of 1002,425,159/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,425,159
Nerdulate something else
Nothing in mind? Surprise me · today’s page