Recognised as Number
1,053,233
- Positive
- Odd
- Prime
- 7 digits
1,053,233 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,233
Digit count7
Digit sum17
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,233
Distinct prime factors11,053,233
Number of divisors2
Sum of divisors σ(n)1,053,234
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,053,232integers below n that share no factor with it
Carmichael function λ(n)1,053,232the 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,2332 in total
Arithmetic
Previous number1,053,232
Next number1,053,234
Double2,106,466
Half526,616.5
Square1,109,299,752,289
Cube1,168,351,106,002,600,337
Square root1,026.271406598≈irrational, shown to 9 decimal places
Cube root101.743846557≈
Negation-1,053,233
Reciprocal9.49457527 × 10^-7≈
Representations
Decimal1,053,233
Binary10000000100100011000121 bits
Octal4011061
Hexadecimal101231
Base 36MKOH
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, fifty-three thousand, two hundred and thirty-three
Ordinalone million, fifty-three thousand, two hundred and thirty-third
Scientific notation1.053233 × 10^6
Engineering notation1.053233 × 10^6
In other bases
Ternary1222111202122base 3; the most digit-efficient integer base after e: 13 digits
Quinary232200413base 5; one hand: 9 digits
Septenary11644436base 7: 8 digits
Nonary1874678base 9; each digit is two ternary digits: 7 digits
Duodecimal429615base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6bd1dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal4:52:33:53base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T000TTTT10T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000001011001110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100000001001000110001
Bit length21 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits15within that length
Bit parityeven6 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 12 31
Gray code110000001101100101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100000001001000110001
64-bit0000000000000000000000000000000000000000000100000001001000110001
One's complement11111111111011111110110111001110at 32 bits, every bit flipped
Bits reversed10001100010010000000100000000000at 32 bits
Rotated left by 100000000001000000010010001100010at 32 bits, wrapping
Shifted left by 11000000010010001100010= 2,106,466, no wrap
Shifted right by 110000000100100011000= 526,616, discarding the low bit
These bits as a double5.20366242 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,053,233 to the power 21,109,299,752,289
1,053,233 to the power 31,168,351,106,002,600,337
1,053,233 to the power 41,230,545,940,428,436,760,739,521
1,053,233 to the power 51,296,051,592,475,263,734,823,967,921,393
First ten multiples1,053,233, 2,106,466, 3,159,699, 4,212,932, 5,266,165, 6,319,398, 7,372,631, 8,425,864, 9,479,097, 10,532,330
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
Collatz (3n + 1) trajectory
Steps to reach 1196the total stopping time
Highest value reached3,159,7003× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,053,233 → 3,159,700 → 1,579,850 → 789,925 → 2,369,776 → 1,184,888 → 592,444 → 296,222 → 148,111 → 444,334 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage105,323,300%
1,053,233% as a decimal10,532.33
1,053,233% of 1001,053,233
1,053,233% of 1,00010,532,330
As a fraction of 1001,053,233/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,233
Nerdulate something else
Nothing in mind? Surprise me · today’s page