Recognised as Number

1,107,051

Positive
Odd
Composite
7 digits

1,107,051 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,107,051

Digit count7

Digit sum15

Digit product0zero, because one of the digits is zero

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 11 × 33,547

Distinct prime factors33, 11, 33,547

Number of divisors8

Sum of divisors σ(n)1,610,304

Aliquot sum503,253sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)167,730the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 670,920

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 11, 33, 33,547, 100,641, 369,017, 1,107,0518 in total

Arithmetic

Previous number1,107,050

Next number1,107,052

Double2,214,102

Half553,525.5

Square1,225,561,916,601

Cube1,356,759,545,335,053,651

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

Cube root103.448105797≈

Negation-1,107,051

Reciprocal9.03300751 × 10^-7≈

Representations

Decimal1,107,051

Binary10000111001000110101121 bits

Octal4162153

Hexadecimal10E46B

Base 36NQ7F

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

In wordsone million, one hundred and seven thousand and fifty-one

Ordinalone million, one hundred and seven thousand and fifty-first

Scientific notation1.107051 × 10^6

Engineering notation1.107051 × 10^6

In other bases

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

Quinary240411201base 5; one hand: 9 digits

Septenary12260361base 7: 8 digits

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

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

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

Sexagesimal5:7:30:51base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001110010001101011

Bit length21 bitsto write the magnitude

Set bits10the population count, or Hamming weight

Zero bits11within that length

Bit parityeven10 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 e4 6b

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

At each machine width

32-bit00000000000100001110010001101011

64-bit0000000000000000000000000000000000000000000100001110010001101011

One's complement11111111111011110001101110010100at 32 bits, every bit flipped

Bits reversed11010110001001110000100000000000at 32 bits

Rotated left by 100000000001000011100100011010110at 32 bits, wrapping

Shifted left by 11000011100100011010110= 2,214,102, no wrap

Shifted right by 110000111001000110101= 553,525, discarding the low bit

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

Nearest landmarks

Next prime1,107,053+2

Previous prime1,107,049−2

Distance to nearest prime2

Nearest square below1,106,704

Nearest square above1,108,809

Powers & multiples

1,107,051 to the power 21,225,561,916,601

1,107,051 to the power 31,356,759,545,335,053,651

1,107,051 to the power 41,502,002,011,422,716,479,393,201

1,107,051 to the power 51,662,792,828,747,529,701,228,722,560,251

First ten multiples1,107,051, 2,214,102, 3,321,153, 4,428,204, 5,535,255, 6,642,306, 7,749,357, 8,856,408, 9,963,459, 11,070,510

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 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 1

Divisible by 8No, remainder 3

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11Yes

Divisible by 12No, remainder 3

Divisible by 100No, remainder 51

Collatz (3n + 1) trajectory

Steps to reach 1165the total stopping time

Highest value reached4,981,7324× the starting value

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

First steps1,107,051 → 3,321,154 → 1,660,577 → 4,981,732 → 2,490,866 → 1,245,433 → 3,736,300 → 1,868,150 → 934,075 → 2,802,226 → …

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

As a percentage & fraction

As a percentage110,705,100%

1,107,051% as a decimal11,070.51

1,107,051% of 1001,107,051

1,107,051% of 1,00011,070,510

As a fraction of 1001,107,051/100

Read another way

As seconds12 days, 19 hours and 30 minutes

As bytes1.056 MiB

As a 24-bit colour#10E46B

Keep nerding

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