Recognised as Number
2,592,409
- Positive
- Odd
- Prime
- 7 digits
2,592,409 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,592,409
Digit count7
Digit sum31
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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,592,409
Distinct prime factors12,592,409
Number of divisors2
Sum of divisors σ(n)2,592,410
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,592,408integers below n that share no factor with it
Carmichael function λ(n)2,592,408the 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,592,4092 in total
Arithmetic
Previous number2,592,408
Next number2,592,410
Double5,184,818
Half1,296,204.5
Square6,720,584,423,281
Cube17,422,503,544,173,473,929
Square root1,610.095959873≈irrational, shown to 9 decimal places
Cube root137.372933852≈
Negation-2,592,409
Reciprocal3.85741602 × 10^-7≈
Representations
Decimal2,592,409
Binary100111100011101001100122 bits
Octal11707231
Hexadecimal278E99
Base 361JKBD
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and ninety-two thousand, four hundred and nine
Ordinaltwo million, five hundred and ninety-two thousand, four hundred and ninth
Scientific notation2.592409 × 10^6
Engineering notation2.592409 × 10^6
In other bases
Ternary11212201010011base 3; the most digit-efficient integer base after e: 14 digits
Quinary1130424114base 5; one hand: 10 digits
Septenary31015021base 7: 8 digits
Nonary4781104base 9; each digit is two ternary digits: 7 digits
Duodecimala502a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalg4109base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal12:0:6:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TT0T0T01010011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110001001001111101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001111000111010011001
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
Bytes327 8e 99
Gray code1101000100100111010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001111000111010011001
64-bit0000000000000000000000000000000000000000001001111000111010011001
One's complement11111111110110000111000101100110at 32 bits, every bit flipped
Bits reversed10011001011100011110010000000000at 32 bits
Rotated left by 100000000010011110001110100110010at 32 bits, wrapping
Shifted left by 110011110001110100110010= 5,184,818, no wrap
Shifted right by 1100111100011101001100= 1,296,204, discarding the low bit
These bits as a double1.28082023 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,592,409 to the power 26,720,584,423,281
2,592,409 to the power 317,422,503,544,173,473,929
2,592,409 to the power 445,166,254,990,447,211,374,804,961
2,592,409 to the power 5117,089,405,933,530,264,792,946,754,141,049
First ten multiples2,592,409, 5,184,818, 7,777,227, 10,369,636, 12,962,045, 15,554,454, 18,146,863, 20,739,272, 23,331,681, 25,924,090
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 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1218the total stopping time
Highest value reached53,212,62420× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,592,409 → 7,777,228 → 3,888,614 → 1,944,307 → 5,832,922 → 2,916,461 → 8,749,384 → 4,374,692 → 2,187,346 → 1,093,673 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage259,240,900%
2,592,409% as a decimal25,924.09
2,592,409% of 1002,592,409
2,592,409% of 1,00025,924,090
As a fraction of 1002,592,409/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,592,409
Nerdulate something else
Nothing in mind? Surprise me · today’s page