Recognised as Number
1,053,981
- Positive
- Odd
- Composite
- 7 digits
1,053,981 is an odd 7-digit integer and a composite number. It has 6 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,053,981
Digit count7
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^2 × 117,109
Distinct prime factors23, 117,109
Number of divisors6
Sum of divisors σ(n)1,522,430
Aliquot sum468,449sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)702,648integers below n that share no factor with it
Carmichael function λ(n)117,108the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 702,648
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 117,109, 351,327, 1,053,9816 in total
Arithmetic
Previous number1,053,980
Next number1,053,982
Double2,107,962
Half526,990.5
Square1,110,875,948,361
Cube1,170,842,142,929,475,141
Square root1,026.635767933≈irrational, shown to 9 decimal places
Cube root101.767926822≈
Negation-1,053,981
Reciprocal9.48783707 × 10^-7≈
Representations
Decimal1,053,981
Binary10000000101010001110121 bits
Octal4012435
Hexadecimal10151D
Base 36ML99
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-three thousand, nine hundred and eighty-one
Ordinalone million, fifty-three thousand, nine hundred and eighty-first
Scientific notation1.053981 × 10^6
Engineering notation1.053981 × 10^6
In other bases
Ternary1222112210100base 3; the most digit-efficient integer base after e: 13 digits
Quinary232211411base 5; one hand: 9 digits
Septenary11646555base 7: 8 digits
Nonary1875710base 9; each digit is two ternary digits: 7 digits
Duodecimal429b39base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6bej1base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:46:21base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000TT0T10100digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001010101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000001010100011101
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 odd
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes310 15 1d
Gray code110000001111110010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000001010100011101
64-bit0000000000000000000000000000000000000000000100000001010100011101
One's complement11111111111011111110101011100010at 32 bits, every bit flipped
Bits reversed10111000101010000000100000000000at 32 bits
Rotated left by 100000000001000000010101000111010at 32 bits, wrapping
Shifted left by 11000000010101000111010= 2,107,962, no wrap
Shifted right by 110000000101010001110= 526,990, discarding the low bit
These bits as a double5.20735803 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,053,981 to the power 21,110,875,948,361
1,053,981 to the power 31,170,842,142,929,475,141
1,053,981 to the power 41,234,045,372,646,951,138,586,321
1,053,981 to the power 51,300,660,375,907,806,207,998,349,193,901
First ten multiples1,053,981, 2,107,962, 3,161,943, 4,215,924, 5,269,905, 6,323,886, 7,377,867, 8,431,848, 9,485,829, 10,539,810
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 3
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 9
Divisible by 100No, remainder 81
Collatz (3n + 1) trajectory
Steps to reach 1165the total stopping time
Highest value reached25,990,79224× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,053,981 → 3,161,944 → 1,580,972 → 790,486 → 395,243 → 1,185,730 → 592,865 → 1,778,596 → 889,298 → 444,649 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,398,100%
1,053,981% as a decimal10,539.81
1,053,981% of 1001,053,981
1,053,981% of 1,00010,539,810
As a fraction of 1001,053,981/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,981
Nerdulate something else
Nothing in mind? Surprise me · today’s page