Recognised as Number
2,537,152
- Positive
- Even
- Composite
- 7 digits
2,537,152 is an even 7-digit integer and a composite number. It has 28 divisors and a digital root of 7.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value2,537,152
Digit count7
Digit sum25
Digit product2,100
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^6 × 29 × 1,367
Distinct prime factors32, 29, 1,367
Number of divisors28
Sum of divisors σ(n)5,212,080
Aliquot sum2,674,928sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)1,223,936integers below n that share no factor with it
Carmichael function λ(n)76,496the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,223,936
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 29, 32, 58, 64, 116, 232, 464, 928, 1,367, 1,856, 2,734, 5,468, 10,936, 21,872, 39,643, 43,744, 79,286, 87,488, 158,572, 317,144, 634,288, 1,268,576, 2,537,15228 in total
Arithmetic
Previous number2,537,151
Next number2,537,153
Double5,074,304
Half1,268,576
Square6,437,140,271,104
Cube16,332,003,313,112,055,808
Square root1,592.843997383≈irrational, shown to 9 decimal places
Cube root136.389884671≈
Negation-2,537,152
Reciprocal3.94142724 × 10^-7≈
Representations
Decimal2,537,152
Binary100110101101101100000022 bits
Octal11533300
Hexadecimal26B6C0
Base 361IDOG
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, five hundred and thirty-seven thousand, one hundred and fifty-two
Ordinaltwo million, five hundred and thirty-seven thousand, one hundred and fifty-second
Scientific notation2.537152 × 10^6
Engineering notation2.537152 × 10^6
In other bases
Ternary11202220022121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1122142102base 5; one hand: 10 digits
Septenary30364642base 7: 8 digits
Nonary4686277base 9; each digit is two ternary digits: 7 digits
Duodecimala24314base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalfh2hcbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal11:44:45:52base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1TTT100T0100TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11110111100101111000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001001101011011011000000
Bit length22 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits12within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 66 trailing zeros
Power of twoNo
Bytes326 b6 c0
Gray code1101011110110110100000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001001101011011011000000
64-bit0000000000000000000000000000000000000000001001101011011011000000
One's complement11111111110110010100100100111111at 32 bits, every bit flipped
Bits reversed00000011011011010110010000000000at 32 bits
Rotated left by 100000000010011010110110110000000at 32 bits, wrapping
Shifted left by 110011010110110110000000= 5,074,304, no wrap
Shifted right by 1100110101101101100000= 1,268,576, discarding the low bit
These bits as a double1.25351964 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,537,152 to the power 26,437,140,271,104
2,537,152 to the power 316,332,003,313,112,055,808
2,537,152 to the power 441,436,774,869,868,878,617,378,816
2,537,152 to the power 5105,131,396,234,637,565,121,839,897,772,032
First ten multiples2,537,152, 5,074,304, 7,611,456, 10,148,608, 12,685,760, 15,222,912, 17,760,064, 20,297,216, 22,834,368, 25,371,520
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 2
Divisible by 8Yes
Divisible by 9No, remainder 7
Divisible by 10No, remainder 2
Divisible by 11No, remainder 2
Divisible by 12No, remainder 4
Divisible by 100No, remainder 52
Collatz (3n + 1) trajectory
Steps to reach 1104the total stopping time
Highest value reached2,537,152
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,537,152 → 1,268,576 → 634,288 → 317,144 → 158,572 → 79,286 → 39,643 → 118,930 → 59,465 → 178,396 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage253,715,200%
2,537,152% as a decimal25,371.52
2,537,152% of 1002,537,152
2,537,152% of 1,00025,371,520
As a fraction of 1002,537,152/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,537,152
Nerdulate something else
Nothing in mind? Surprise me · today’s page