Recognised as Number
1,252,496
- Positive
- Even
- Composite
- 7 digits
1,252,496 is an even 7-digit integer and a composite number. It has 40 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,252,496
Digit count7
Digit sum29
Digit product4,320
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^4 × 7 × 53 × 211
Distinct prime factors42, 7, 53, 211
Number of divisors40
Sum of divisors σ(n)2,839,104
Aliquot sum1,586,608sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)524,160integers below n that share no factor with it
Carmichael function λ(n)5,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 524,160
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 8, 14, 16, 28, 53, 56, 106, 112, 211, 212, 371, 422, 424, 742, 844, 848, 1,477, 1,484, 1,688, 2,954, 2,968, 3,376, 5,908, 5,936, 11,183, 11,816, 22,366, 23,632, 44,732, 78,281, 89,464, 156,562, 178,928, 313,124, 626,248, 1,252,49640 in total
Arithmetic
Previous number1,252,495
Next number1,252,497
Double2,504,992
Half626,248
Square1,568,746,230,016
Cube1,964,848,378,110,119,936
Square root1,119.14967721≈irrational, shown to 9 decimal places
Cube root107.793386418≈
Negation-1,252,496
Reciprocal7.98405743 × 10^-7≈
Representations
Decimal1,252,496
Binary10011000111001001000021 bits
Octal4616220
Hexadecimal131C90
Base 36QUFK
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, two hundred and fifty-two thousand, four hundred and ninety-six
Ordinalone million, two hundred and fifty-two thousand, four hundred and ninety-sixth
Scientific notation1.252496 × 10^6
Engineering notation1.252496 × 10^6
In other bases
Ternary2100122002202base 3; the most digit-efficient integer base after e: 13 digits
Quinary310034441base 5; one hand: 9 digits
Septenary13434410base 7: 8 digits
Nonary2318082base 9; each digit is two ternary digits: 7 digits
Duodecimal5049a8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal7gb4gbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:47:54:56base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T101T0T010T1Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110110110110010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100110001110010010000
Bit length21 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits13within that length
Bit parityeven8 set bits, so even; not the same as the number itself being even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes313 1c 90
Gray code110101001001011011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100110001110010010000
64-bit0000000000000000000000000000000000000000000100110001110010010000
One's complement11111111111011001110001101101111at 32 bits, every bit flipped
Bits reversed00001001001110001100100000000000at 32 bits
Rotated left by 100000000001001100011100100100000at 32 bits, wrapping
Shifted left by 11001100011100100100000= 2,504,992, no wrap
Shifted right by 110011000111001001000= 626,248, discarding the low bit
These bits as a double6.18815245 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,252,496 to the power 21,568,746,230,016
1,252,496 to the power 31,964,848,378,110,119,936
1,252,496 to the power 42,460,964,734,189,412,779,360,256
1,252,496 to the power 53,082,348,485,713,302,748,497,603,198,976
First ten multiples1,252,496, 2,504,992, 3,757,488, 5,009,984, 6,262,480, 7,514,976, 8,767,472, 10,019,968, 11,272,464, 12,524,960
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 1
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8Yes
Divisible by 9No, remainder 2
Divisible by 10No, remainder 6
Divisible by 11No, remainder 3
Divisible by 12No, remainder 8
Divisible by 100No, remainder 96
Collatz (3n + 1) trajectory
Steps to reach 1111the total stopping time
Highest value reached1,252,496
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,252,496 → 626,248 → 313,124 → 156,562 → 78,281 → 234,844 → 117,422 → 58,711 → 176,134 → 88,067 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage125,249,600%
1,252,496% as a decimal12,524.96
1,252,496% of 1001,252,496
1,252,496% of 1,00012,524,960
As a fraction of 1001,252,496/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 1,252,496
Nerdulate something else
Nothing in mind? Surprise me · today’s page