Recognised as Number
2,524,309
- Positive
- Odd
- Prime
- 7 digits
2,524,309 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,524,309
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,524,309
Distinct prime factors12,524,309
Number of divisors2
Sum of divisors σ(n)2,524,310
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,524,308integers below n that share no factor with it
Carmichael function λ(n)2,524,308the 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,524,3092 in total
Arithmetic
Previous number2,524,308
Next number2,524,310
Double5,048,618
Half1,262,154.5
Square6,372,135,927,481
Cube16,085,240,070,963,635,629
Square root1,588.807414384≈irrational, shown to 9 decimal places
Cube root136.159361202≈
Negation-2,524,309
Reciprocal3.96148015 × 10^-7≈
Representations
Decimal2,524,309
Binary100110100001001001010122 bits
Octal11502225
Hexadecimal268495
Base 361I3RP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and twenty-four thousand, three hundred and nine
Ordinaltwo million, five hundred and twenty-four thousand, three hundred and ninth
Scientific notation2.524309 × 10^6
Engineering notation2.524309 × 10^6
In other bases
Ternary11202020200221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1121234214base 5; one hand: 10 digits
Septenary30312334base 7: 8 digits
Nonary4666627base 9; each digit is two ternary digits: 7 digits
Duodecimala189b1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalffaf9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:41:11:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT1T1T1T010T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111000010110010101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001101000010010010101
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
Bytes326 84 95
Gray code1101011100011011011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001101000010010010101
64-bit0000000000000000000000000000000000000000001001101000010010010101
One's complement11111111110110010111101101101010at 32 bits, every bit flipped
Bits reversed10101001001000010110010000000000at 32 bits
Rotated left by 100000000010011010000100100101010at 32 bits, wrapping
Shifted left by 110011010000100100101010= 5,048,618, no wrap
Shifted right by 1100110100001001001010= 1,262,154, discarding the low bit
These bits as a double1.24717436 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,524,309 to the power 26,372,135,927,481
2,524,309 to the power 316,085,240,070,963,635,629
2,524,309 to the power 440,604,116,278,294,144,091,005,361
2,524,309 to the power 5102,497,336,158,344,412,576,221,651,820,549
First ten multiples2,524,309, 5,048,618, 7,572,927, 10,097,236, 12,621,545, 15,145,854, 17,670,163, 20,194,472, 22,718,781, 25,243,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 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 7
Divisible by 12No, remainder 1
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1104the total stopping time
Highest value reached7,676,3683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,524,309 → 7,572,928 → 3,786,464 → 1,893,232 → 946,616 → 473,308 → 236,654 → 118,327 → 354,982 → 177,491 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage252,430,900%
2,524,309% as a decimal25,243.09
2,524,309% of 1002,524,309
2,524,309% of 1,00025,243,090
As a fraction of 1002,524,309/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,524,309
Nerdulate something else
Nothing in mind? Surprise me · today’s page