Recognised as Number
2,542,237
- Positive
- Odd
- Prime
- 7 digits
2,542,237 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,542,237
Digit count7
Digit sum25
Digit product3,360
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,542,237
Distinct prime factors12,542,237
Number of divisors2
Sum of divisors σ(n)2,542,238
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,542,236integers below n that share no factor with it
Carmichael function λ(n)2,542,236the 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,542,2372 in total
Arithmetic
Previous number2,542,236
Next number2,542,238
Double5,084,474
Half1,271,118.5
Square6,462,968,964,169
Cube16,430,398,830,562,106,053
Square root1,594.439399915≈irrational, shown to 9 decimal places
Cube root136.480942117≈
Negation-2,542,237
Reciprocal3.93354357 × 10^-7≈
Representations
Decimal2,542,237
Binary100110110010101001110122 bits
Octal11545235
Hexadecimal26CA9D
Base 361IHLP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and forty-two thousand, two hundred and thirty-seven
Ordinaltwo million, five hundred and forty-two thousand, two hundred and thirty-seventh
Scientific notation2.542237 × 10^6
Engineering notation2.542237 × 10^6
In other bases
Ternary11210011021221base 3; the most digit-efficient integer base after e: 14 digits
Quinary1122322422base 5; one hand: 10 digits
Septenary30415525base 7: 8 digits
Nonary4704257base 9; each digit is two ternary digits: 7 digits
Duodecimala27251base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfhfbhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:46:10:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT1001110T0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111101111111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001101100101010011101
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
Bytes326 ca 9d
Gray code1101011010111111010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001101100101010011101
64-bit0000000000000000000000000000000000000000001001101100101010011101
One's complement11111111110110010011010101100010at 32 bits, every bit flipped
Bits reversed10111001010100110110010000000000at 32 bits
Rotated left by 100000000010011011001010100111010at 32 bits, wrapping
Shifted left by 110011011001010100111010= 5,084,474, no wrap
Shifted right by 1100110110010101001110= 1,271,118, discarding the low bit
These bits as a double1.25603197 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,542,237 to the power 26,462,968,964,169
2,542,237 to the power 316,430,398,830,562,106,053
2,542,237 to the power 441,769,967,831,811,716,805,860,561
2,542,237 to the power 5106,189,157,710,841,523,497,380,535,014,957
First ten multiples2,542,237, 5,084,474, 7,626,711, 10,168,948, 12,711,185, 15,253,422, 17,795,659, 20,337,896, 22,880,133, 25,422,370
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1187the total stopping time
Highest value reached41,793,56816× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,542,237 → 7,626,712 → 3,813,356 → 1,906,678 → 953,339 → 2,860,018 → 1,430,009 → 4,290,028 → 2,145,014 → 1,072,507 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage254,223,700%
2,542,237% as a decimal25,422.37
2,542,237% of 1002,542,237
2,542,237% of 1,00025,422,370
As a fraction of 1002,542,237/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,542,237
Nerdulate something else
Nothing in mind? Surprise me · today’s page