Recognised as Number
1,128,209
- Positive
- Odd
- Prime
- 7 digits
1,128,209 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,128,209
Digit count7
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,128,209
Distinct prime factors11,128,209
Number of divisors2
Sum of divisors σ(n)1,128,210
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,128,208integers below n that share no factor with it
Carmichael function λ(n)1,128,208the 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, 1,128,2092 in total
Arithmetic
Previous number1,128,208
Next number1,128,210
Double2,256,418
Half564,104.5
Square1,272,855,547,681
Cube1,436,047,084,593,633,329
Square root1,062.171831673≈irrational, shown to 9 decimal places
Cube root104.102986002≈
Negation-1,128,209
Reciprocal8.86360595 × 10^-7≈
Representations
Decimal1,128,209
Binary10001001101110001000121 bits
Octal4233421
Hexadecimal113711
Base 36O6J5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and twenty-eight thousand, two hundred and nine
Ordinalone million, one hundred and twenty-eight thousand, two hundred and ninth
Scientific notation1.128209 × 10^6
Engineering notation1.128209 × 10^6
In other bases
Ternary2010022121112base 3; the most digit-efficient integer base after e: 13 digits
Quinary242100314base 5; one hand: 9 digits
Septenary12406145base 7: 8 digits
Nonary2108545base 9; each digit is two ternary digits: 7 digits
Duodecimal464a95base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal710a9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:13:23:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T010100T0TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010100101100010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100010011011100010001
Bit length21 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits12within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes311 37 11
Gray code110011010110010011001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100010011011100010001
64-bit0000000000000000000000000000000000000000000100010011011100010001
One's complement11111111111011101100100011101110at 32 bits, every bit flipped
Bits reversed10001000111011001000100000000000at 32 bits
Rotated left by 100000000001000100110111000100010at 32 bits, wrapping
Shifted left by 11000100110111000100010= 2,256,418, no wrap
Shifted right by 110001001101110001000= 564,104, discarding the low bit
These bits as a double5.57409308 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,128,209 to the power 21,272,855,547,681
1,128,209 to the power 31,436,047,084,593,633,329
1,128,209 to the power 41,620,161,245,262,298,464,477,761
1,128,209 to the power 51,827,880,498,356,132,488,309,990,260,049
First ten multiples1,128,209, 2,256,418, 3,384,627, 4,512,836, 5,641,045, 6,769,254, 7,897,463, 9,025,672, 10,153,881, 11,282,090
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1108the total stopping time
Highest value reached3,384,6283× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,128,209 → 3,384,628 → 1,692,314 → 846,157 → 2,538,472 → 1,269,236 → 634,618 → 317,309 → 951,928 → 475,964 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage112,820,900%
1,128,209% as a decimal11,282.09
1,128,209% of 1001,128,209
1,128,209% of 1,00011,282,090
As a fraction of 1001,128,209/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,128,209
Nerdulate something else
Nothing in mind? Surprise me · today’s page