Recognised as Number

1,010,551

Positive
Odd
Composite
7 digits

1,010,551 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,010,551

Digit count7

Digit sum13

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation23 × 53 × 829

Distinct prime factors323, 53, 829

Number of divisors8

Sum of divisors σ(n)1,075,680

Aliquot sum65,129sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)118,404the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 947,232

Möbius function μ(n)−13 distinct prime factors, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 23, 53, 829, 1,219, 19,067, 43,937, 1,010,5518 in total

Arithmetic

Previous number1,010,550

Next number1,010,552

Double2,021,102

Half505,275.5

Square1,021,213,323,601

Cube1,031,988,145,378,314,151

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

Cube root100.350470271≈

Negation-1,010,551

Reciprocal9.89559161 × 10^-7≈

Representations

Decimal1,010,551

Binary1111011010110111011120 bits

Octal3665567

HexadecimalF6B77

Base 36LNQV

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

In wordsone million, ten thousand, five hundred and fifty-one

Ordinalone million, ten thousand, five hundred and fifty-first

Scientific notation1.010551 × 10^6

Engineering notation1.010551 × 10^6

In other bases

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

Quinary224314201base 5; one hand: 9 digits

Septenary11406133base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000011110110101101110111

Bit length20 bitsto write the magnitude

Set bits15the population count, or Hamming weight

Zero bits5within that length

Bit parityodd15 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 6b 77

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

At each machine width

32-bit00000000000011110110101101110111

64-bit0000000000000000000000000000000000000000000011110110101101110111

One's complement11111111111100001001010010001000at 32 bits, every bit flipped

Bits reversed11101110110101101111000000000000at 32 bits

Rotated left by 100000000000111101101011011101110at 32 bits, wrapping

Shifted left by 1111101101011011101110= 2,021,102, no wrap

Shifted right by 11111011010110111011= 505,275, discarding the low bit

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

Nearest landmarks

Next prime1,010,567+16

Previous prime1,010,549−2

Distance to nearest prime2

Nearest square below1,010,025

Nearest square above1,012,036

Powers & multiples

1,010,551 to the power 21,021,213,323,601

1,010,551 to the power 31,031,988,145,378,314,151

1,010,551 to the power 41,042,876,652,300,200,743,607,201

1,010,551 to the power 51,053,880,043,858,620,161,653,000,577,751

First ten multiples1,010,551, 2,021,102, 3,031,653, 4,042,204, 5,052,755, 6,063,306, 7,073,857, 8,084,408, 9,094,959, 10,105,510

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 3

Divisible by 12No, remainder 7

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 182the total stopping time

Highest value reached6,821,2246× the starting value

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

First steps1,010,551 → 3,031,654 → 1,515,827 → 4,547,482 → 2,273,741 → 6,821,224 → 3,410,612 → 1,705,306 → 852,653 → 2,557,960 → …

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

As a percentage & fraction

As a percentage101,055,100%

1,010,551% as a decimal10,105.51

1,010,551% of 1001,010,551

1,010,551% of 1,00010,105,510

As a fraction of 1001,010,551/100

Read another way

As seconds11 days, 16 hours and 42 minutes

As bytes986.866 KiB

As a 24-bit colour#0F6B77

Keep nerding

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