Recognised as Number

1,111,902

Positive
Even
Composite
7 digits

1,111,902 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,111,902

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 factorisation2 × 3 × 11 × 17 × 991

Distinct prime factors52, 3, 11, 17, 991

Number of divisors32

Sum of divisors σ(n)2,571,264

Aliquot sum1,459,362sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 11, 17, 22, 33, 34, 51, 66, 102, 187, 374, 561, 991, 1,122, 1,982, 2,973, 5,946, 10,901, 16,847, 21,802, 32,703, 33,694, 50,541, 65,406, 101,082, 185,317, 370,634, 555,951, 1,111,90232 in total

Arithmetic

Previous number1,111,901

Next number1,111,903

Double2,223,804

Half555,951

Square1,236,326,057,604

Cube1,374,673,416,102,002,808

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

Cube root103.598985793≈

Negation-1,111,902

Reciprocal8.99359836 × 10^-7≈

Representations

Decimal1,111,902

Binary10000111101110101111021 bits

Octal4173536

Hexadecimal10F75E

Base 36NTY6

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

In wordsone million, one hundred and eleven thousand, nine hundred and two

Ordinalone million, one hundred and eleven thousand, nine hundred and second

Scientific notation1.111902 × 10^6

Engineering notation1.111902 × 10^6

In other bases

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

Quinary241040102base 5; one hand: 9 digits

Septenary12310461base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001111011101011110

Bit length21 bitsto write the magnitude

Set bits13the population count, or Hamming weight

Zero bits8within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes310 f7 5e

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

At each machine width

32-bit00000000000100001111011101011110

64-bit0000000000000000000000000000000000000000000100001111011101011110

One's complement11111111111011110000100010100001at 32 bits, every bit flipped

Bits reversed01111010111011110000100000000000at 32 bits

Rotated left by 100000000001000011110111010111100at 32 bits, wrapping

Shifted left by 11000011110111010111100= 2,223,804, no wrap

Shifted right by 110000111101110101111= 555,951, discarding the low bit

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

Nearest landmarks

Next prime1,111,921+19

Previous prime1,111,897−5

Distance to nearest prime5

Nearest square below1,110,916

Nearest square above1,113,025

Powers & multiples

1,111,902 to the power 21,236,326,057,604

1,111,902 to the power 31,374,673,416,102,002,808

1,111,902 to the power 41,528,502,120,710,649,126,220,816

1,111,902 to the power 51,699,544,565,022,412,184,743,177,752,032

First ten multiples1,111,902, 2,223,804, 3,335,706, 4,447,608, 5,559,510, 6,671,412, 7,783,314, 8,895,216, 10,007,118, 11,119,020

Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)

Divisibility tests

Divisible by 2Yes

Divisible by 3Yes

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11Yes

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached5,629,0125× the starting value

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

First steps1,111,902 → 555,951 → 1,667,854 → 833,927 → 2,501,782 → 1,250,891 → 3,752,674 → 1,876,337 → 5,629,012 → 2,814,506 → …

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

As a percentage & fraction

As a percentage111,190,200%

1,111,902% as a decimal11,119.02

1,111,902% of 1001,111,902

1,111,902% of 1,00011,119,020

As a fraction of 1001,111,902/100

Read another way

As seconds12 days, 20 hours and 51 minutes

As bytes1.06 MiB

As a 24-bit colour#10F75E

Keep nerding

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