Recognised as Number
1,053,989
- Positive
- Odd
- Prime
- 7 digits
1,053,989 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 8.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,053,989
Digit count7
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation1,053,989
Distinct prime factors11,053,989
Number of divisors2
Sum of divisors σ(n)1,053,990
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,053,988integers below n that share no factor with it
Carmichael function λ(n)1,053,988the 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,053,9892 in total
Arithmetic
Previous number1,053,988
Next number1,053,990
Double2,107,978
Half526,994.5
Square1,110,892,812,121
Cube1,170,868,804,154,600,669
Square root1,026.639664147≈irrational, shown to 9 decimal places
Cube root101.768184303≈
Negation-1,053,989
Reciprocal9.48776505 × 10^-7≈
Representations
Decimal1,053,989
Binary10000000101010010010121 bits
Octal4012445
Hexadecimal101525
Base 36ML9H
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-three thousand, nine hundred and eighty-nine
Ordinalone million, fifty-three thousand, nine hundred and eighty-ninth
Scientific notation1.053989 × 10^6
Engineering notation1.053989 × 10^6
In other bases
Ternary1222112210122base 3; the most digit-efficient integer base after e: 13 digits
Quinary232211424base 5; one hand: 9 digits
Septenary11646566base 7: 8 digits
Nonary1875718base 9; each digit is two ternary digits: 7 digits
Duodecimal429b45base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6bej9base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:46:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000TT0T11T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001010101100101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000001010100100101
Bit length21 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits14within that length
Bit parityodd7 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
Bytes310 15 25
Gray code110000001111110110111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000001010100100101
64-bit0000000000000000000000000000000000000000000100000001010100100101
One's complement11111111111011111110101011011010at 32 bits, every bit flipped
Bits reversed10100100101010000000100000000000at 32 bits
Rotated left by 100000000001000000010101001001010at 32 bits, wrapping
Shifted left by 11000000010101001001010= 2,107,978, no wrap
Shifted right by 110000000101010010010= 526,994, discarding the low bit
These bits as a double5.20739756 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,053,989 to the power 21,110,892,812,121
1,053,989 to the power 31,170,868,804,154,600,669
1,053,989 to the power 41,234,082,840,022,103,404,518,641
1,053,989 to the power 51,300,709,738,472,056,745,225,197,908,949
First ten multiples1,053,989, 2,107,978, 3,161,967, 4,215,956, 5,269,945, 6,323,934, 7,377,923, 8,431,912, 9,485,901, 10,539,890
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 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 5
Divisible by 100No, remainder 89
Collatz (3n + 1) trajectory
Steps to reach 1152the total stopping time
Highest value reached3,161,9683× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,053,989 → 3,161,968 → 1,580,984 → 790,492 → 395,246 → 197,623 → 592,870 → 296,435 → 889,306 → 444,653 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,398,900%
1,053,989% as a decimal10,539.89
1,053,989% of 1001,053,989
1,053,989% of 1,00010,539,890
As a fraction of 1001,053,989/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,053,989
Nerdulate something else
Nothing in mind? Surprise me · today’s page