Recognised as Number

1,055,233

Positive
Odd
Prime
7 digits

1,055,233 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,055,233

Digit count7

Digit sum19

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,055,233

Distinct prime factors11,055,233

Number of divisors2

Sum of divisors σ(n)1,055,234

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)1,055,232integers below n that share no factor with it

Carmichael function λ(n)1,055,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,055,2332 in total

Arithmetic

Previous number1,055,232

Next number1,055,234

Double2,110,466

Half527,616.5

Square1,113,516,684,289

Cube1,175,019,551,312,334,337

Square root1,027.245345572≈irrational, shown to 9 decimal places

Cube root101.80820681≈

Negation-1,055,233

Reciprocal9.47658005 × 10^-7≈

Representations

Decimal1,055,233

Binary10000000110100000000121 bits

Octal4015001

Hexadecimal101A01

Base 36MM81

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsone million, fifty-five thousand, two hundred and thirty-three

Ordinalone million, fifty-five thousand, two hundred and thirty-third

Scientific notation1.055233 × 10^6

Engineering notation1.055233 × 10^6

In other bases

Ternary1222121111201base 3; the most digit-efficient integer base after e: 13 digits

Quinary232231413base 5; one hand: 9 digits

Septenary11653324base 7: 8 digits

Nonary1877451base 9; each digit is two ternary digits: 7 digits

Duodecimal42a801base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits

Vigesimal6bi1dbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits

Sexagesimal4:53:7:13base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

Balanced ternary1T000T0TTTTT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary100000110111000000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000100000001101000000001

Bit length21 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits16within that length

Bit parityodd5 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 1a 01

Gray code110000001011100000001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000100000001101000000001

64-bit0000000000000000000000000000000000000000000100000001101000000001

One's complement11111111111011111110010111111110at 32 bits, every bit flipped

Bits reversed10000000010110000000100000000000at 32 bits

Rotated left by 100000000001000000011010000000010at 32 bits, wrapping

Shifted left by 11000000011010000000010= 2,110,466, no wrap

Shifted right by 110000000110100000000= 527,616, discarding the low bit

These bits as a double5.21354374 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime1,055,251+18

Previous prime1,055,231−2

Distance to nearest prime0, it is prime

Nearest square below1,054,729

Nearest square above1,056,784

Powers & multiples

1,055,233 to the power 21,113,516,684,289

1,055,233 to the power 31,175,019,551,312,334,337

1,055,233 to the power 41,239,919,406,189,968,499,435,521

1,055,233 to the power 51,308,403,874,752,059,029,564,843,131,393

First ten multiples1,055,233, 2,110,466, 3,165,699, 4,220,932, 5,276,165, 6,331,398, 7,386,631, 8,441,864, 9,497,097, 10,552,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 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 1

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached3,165,7003× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps1,055,233 → 3,165,700 → 1,582,850 → 791,425 → 2,374,276 → 1,187,138 → 593,569 → 1,780,708 → 890,354 → 445,177 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage105,523,300%

1,055,233% as a decimal10,552.33

1,055,233% of 1001,055,233

1,055,233% of 1,00010,552,330

As a fraction of 1001,055,233/100

Read another way

As seconds12 days, 5 hours and 7 minutes

As bytes1.006 MiB

As a 24-bit colour#101A01

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.