Recognised as Number
2,425,167
- Positive
- Odd
- Composite
- 7 digits
2,425,167 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value2,425,167
Digit count7
Digit sum27
Digit product3,360
Multiplicative persistence2times 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^3 × 89,821
Distinct prime factors23, 89,821
Number of divisors8
Sum of divisors σ(n)3,592,880
Aliquot sum1,167,713sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,616,760integers below n that share no factor with it
Carmichael function λ(n)89,820the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,616,760
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 89,821, 269,463, 808,389, 2,425,1678 in total
Arithmetic
Previous number2,425,166
Next number2,425,168
Double4,850,334
Half1,212,583.5
Square5,881,434,977,889
Cube14,263,462,021,022,132,463
Square root1,557.294769785≈irrational, shown to 9 decimal places
Cube root134.35295308≈
Negation-2,425,167
Reciprocal4.12342738 × 10^-7≈
Representations
Decimal2,425,167
Binary100101000000010100111122 bits
Octal11200517
Hexadecimal25014F
Base 361FZ9R
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, four hundred and twenty-five thousand, one hundred and sixty-seven
Ordinaltwo million, four hundred and twenty-five thousand, one hundred and sixty-seventh
Scientific notation2.425167 × 10^6
Engineering notation2.425167 × 10^6
In other bases
Ternary11120012201000base 3; the most digit-efficient integer base after e: 14 digits
Quinary1110101132base 5; one hand: 10 digits
Septenary26420313base 7: 8 digits
Nonary4505630base 9; each digit is two ternary digits: 7 digits
Duodecimal98b553base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalf32i7base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:13:39:27base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTTT01T0T01000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001010000000101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001010000000101001111
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; 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 4f
Gray code1101111000000111101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001010000000101001111
64-bit0000000000000000000000000000000000000000001001010000000101001111
One's complement11111111110110101111111010110000at 32 bits, every bit flipped
Bits reversed11110010100000001010010000000000at 32 bits
Rotated left by 100000000010010100000001010011110at 32 bits, wrapping
Shifted left by 110010100000001010011110= 4,850,334, no wrap
Shifted right by 1100101000000010100111= 1,212,583, discarding the low bit
These bits as a double1.1981917 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,425,167 to the power 25,881,434,977,889
2,425,167 to the power 314,263,462,021,022,132,463
2,425,167 to the power 434,591,277,399,136,181,918,896,321
2,425,167 to the power 583,889,624,436,230,896,895,704,034,110,607
First ten multiples2,425,167, 4,850,334, 7,275,501, 9,700,668, 12,125,835, 14,551,002, 16,976,169, 19,401,336, 21,826,503, 24,251,670
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
Collatz (3n + 1) trajectory
Steps to reach 1205the total stopping time
Highest value reached52,442,80021× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,425,167 → 7,275,502 → 3,637,751 → 10,913,254 → 5,456,627 → 16,369,882 → 8,184,941 → 24,554,824 → 12,277,412 → 6,138,706 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage242,516,700%
2,425,167% as a decimal24,251.67
2,425,167% of 1002,425,167
2,425,167% of 1,00024,251,670
As a fraction of 1002,425,167/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,167
Nerdulate something else
Nothing in mind? Surprise me · today’s page