Recognised as Number

1,011,553

Positive
Odd
Prime
7 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value1,011,553

Digit count7

Digit sum16

Digit product0zero, because one of the digits is zero

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

Digital root7repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation1,011,553

Distinct prime factors11,011,553

Number of divisors2

Sum of divisors σ(n)1,011,554

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,011,552the 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,011,5532 in total

Arithmetic

Previous number1,011,552

Next number1,011,554

Double2,023,106

Half505,776.5

Square1,023,239,471,809

Cube1,035,060,957,426,809,377

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

Cube root100.383626426≈

Negation-1,011,553

Reciprocal9.88578947 × 10^-7≈

Representations

Decimal1,011,553

Binary1111011011110110000120 bits

Octal3667541

HexadecimalF6F61

Base 36LOIP

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

In wordsone million, eleven thousand, five hundred and fifty-three

Ordinalone million, eleven thousand, five hundred and fifty-third

Scientific notation1.011553 × 10^6

Engineering notation1.011553 × 10^6

In other bases

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

Quinary224332203base 5; one hand: 9 digits

Septenary11412064base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000011110110111101100001

Bit length20 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits7within that length

Bit parityodd13 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 19worth 524,288

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes30f 6f 61

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

At each machine width

32-bit00000000000011110110111101100001

64-bit0000000000000000000000000000000000000000000011110110111101100001

One's complement11111111111100001001000010011110at 32 bits, every bit flipped

Bits reversed10000110111101101111000000000000at 32 bits

Rotated left by 100000000000111101101111011000010at 32 bits, wrapping

Shifted left by 1111101101111011000010= 2,023,106, no wrap

Shifted right by 11111011011110110000= 505,776, discarding the low bit

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

Nearest landmarks

Next prime1,011,559+6

Previous prime1,011,539−14

Distance to nearest prime0, it is prime

Nearest square below1,010,025

Nearest square above1,012,036

Powers & multiples

1,011,553 to the power 21,023,239,471,809

1,011,553 to the power 31,035,060,957,426,809,377

1,011,553 to the power 41,047,019,016,667,961,305,732,481

1,011,553 to the power 51,059,115,227,367,526,262,697,608,352,993

First ten multiples1,011,553, 2,023,106, 3,034,659, 4,046,212, 5,057,765, 6,069,318, 7,080,871, 8,092,424, 9,103,977, 10,115,530

Powers of twoBetween 2^19 (524,288) and 2^20 (1,048,576)

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 7

Divisible by 10No, remainder 3

Divisible by 11No, remainder 4

Divisible by 12No, remainder 1

Divisible by 100No, remainder 53

Collatz (3n + 1) trajectory

Steps to reach 1183the total stopping time

Highest value reached4,860,9524× the starting value

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

First steps1,011,553 → 3,034,660 → 1,517,330 → 758,665 → 2,275,996 → 1,137,998 → 568,999 → 1,706,998 → 853,499 → 2,560,498 → …

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

As a percentage & fraction

As a percentage101,155,300%

1,011,553% as a decimal10,115.53

1,011,553% of 1001,011,553

1,011,553% of 1,00010,115,530

As a fraction of 1001,011,553/100

Read another way

As seconds11 days, 16 hours and 59 minutes

As bytes987.845 KiB

As a 24-bit colour#0F6F61

Keep nerding

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