Recognised as Number
1,027,249
- Positive
- Odd
- Composite
- 7 digits
1,027,249 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,027,249
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation23 × 59 × 757
Distinct prime factors323, 59, 757
Number of divisors8
Sum of divisors σ(n)1,091,520
Aliquot sum64,271sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)964,656integers below n that share no factor with it
Carmichael function λ(n)241,164the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 964,656
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 23, 59, 757, 1,357, 17,411, 44,663, 1,027,2498 in total
Arithmetic
Previous number1,027,248
Next number1,027,250
Double2,054,498
Half513,624.5
Square1,055,240,508,001
Cube1,083,994,756,603,519,249
Square root1,013.532929904≈irrational, shown to 9 decimal places
Cube root100.900172579≈
Negation-1,027,249
Reciprocal9.73473812 × 10^-7≈
Representations
Decimal1,027,249
Binary1111101011001011000120 bits
Octal3726261
HexadecimalFACB1
Base 36M0MP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, twenty-seven thousand, two hundred and forty-nine
Ordinalone million, twenty-seven thousand, two hundred and forty-ninth
Scientific notation1.027249 × 10^6
Engineering notation1.027249 × 10^6
In other bases
Ternary1221012010021base 3; the most digit-efficient integer base after e: 13 digits
Quinary230332444base 5; one hand: 9 digits
Septenary11505616base 7: 8 digits
Nonary1835107base 9; each digit is two ternary digits: 7 digits
Duodecimal416581base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal68829base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:45:20:49base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0T11TT0101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100001111110111110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000011111010110010110001
Bit length20 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits8within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 19worth 524,288
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes30f ac b1
Gray code10000111101011101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000011111010110010110001
64-bit0000000000000000000000000000000000000000000011111010110010110001
One's complement11111111111100000101001101001110at 32 bits, every bit flipped
Bits reversed10001101001101011111000000000000at 32 bits
Rotated left by 100000000000111110101100101100010at 32 bits, wrapping
Shifted left by 1111110101100101100010= 2,054,498, no wrap
Shifted right by 11111101011001011000= 513,624, discarding the low bit
These bits as a double5.07528441 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,027,249 to the power 21,055,240,508,001
1,027,249 to the power 31,083,994,756,603,519,249
1,027,249 to the power 41,113,532,529,726,208,545,016,001
1,027,249 to the power 51,143,875,177,628,718,001,659,142,011,249
First ten multiples1,027,249, 2,054,498, 3,081,747, 4,108,996, 5,136,245, 6,163,494, 7,190,743, 8,217,992, 9,245,241, 10,272,490
Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)
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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 49
Collatz (3n + 1) trajectory
Steps to reach 1103the total stopping time
Highest value reached3,081,7483× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,027,249 → 3,081,748 → 1,540,874 → 770,437 → 2,311,312 → 1,155,656 → 577,828 → 288,914 → 144,457 → 433,372 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage102,724,900%
1,027,249% as a decimal10,272.49
1,027,249% of 1001,027,249
1,027,249% of 1,00010,272,490
As a fraction of 1001,027,249/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,027,249
Nerdulate something else
Nothing in mind? Surprise me · today’s page