Recognised as Number

1,111,302

Positive
Even
Composite
7 digits

1,111,302 is an even 7-digit integer and a composite number. It has 24 divisors and a digital root of 9.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,111,302

Digit count7

Digit sum9

Digit product0zero, because one of the digits is zero

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

Digital root9repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3^2 × 107 × 577

Distinct prime factors42, 3, 107, 577

Number of divisors24

Sum of divisors σ(n)2,434,536

Aliquot sum1,323,234sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)30,528the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 366,336

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 3, 6, 9, 18, 107, 214, 321, 577, 642, 963, 1,154, 1,731, 1,926, 3,462, 5,193, 10,386, 61,739, 123,478, 185,217, 370,434, 555,651, 1,111,30224 in total

Arithmetic

Previous number1,111,301

Next number1,111,303

Double2,222,604

Half555,651

Square1,234,992,135,204

Cube1,372,449,229,836,475,608

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

Cube root103.580347887≈

Negation-1,111,302

Reciprocal8.99845407 × 10^-7≈

Representations

Decimal1,111,302

Binary10000111101010000011021 bits

Octal4172406

Hexadecimal10F506

Base 36NTHI

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

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

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

Scientific notation1.111302 × 10^6

Engineering notation1.111302 × 10^6

In other bases

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

Quinary241030202base 5; one hand: 9 digits

Septenary12305643base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001111010100000110

Bit length21 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits12within that length

Bit parityodd9 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 f5 06

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

At each machine width

32-bit00000000000100001111010100000110

64-bit0000000000000000000000000000000000000000000100001111010100000110

One's complement11111111111011110000101011111001at 32 bits, every bit flipped

Bits reversed01100000101011110000100000000000at 32 bits

Rotated left by 100000000001000011110101000001100at 32 bits, wrapping

Shifted left by 11000011110101000001100= 2,222,604, no wrap

Shifted right by 110000111101010000011= 555,651, discarding the low bit

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

Nearest landmarks

Next prime1,111,333+31

Previous prime1,111,301−1

Distance to nearest prime1

Nearest square below1,110,916

Nearest square above1,113,025

Powers & multiples

1,111,302 to the power 21,234,992,135,204

1,111,302 to the power 31,372,449,229,836,475,608

1,111,302 to the power 41,525,205,574,015,735,016,121,616

1,111,302 to the power 51,694,964,004,814,834,354,885,984,104,032

First ten multiples1,111,302, 2,222,604, 3,333,906, 4,445,208, 5,556,510, 6,667,812, 7,779,114, 8,890,416, 10,001,718, 11,113,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 3

Divisible by 8No, remainder 6

Divisible by 9Yes

Divisible by 10No, remainder 2

Divisible by 11No, remainder 5

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached2,500,4322× the starting value

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

First steps1,111,302 → 555,651 → 1,666,954 → 833,477 → 2,500,432 → 1,250,216 → 625,108 → 312,554 → 156,277 → 468,832 → …

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

As a percentage & fraction

As a percentage111,130,200%

1,111,302% as a decimal11,113.02

1,111,302% of 1001,111,302

1,111,302% of 1,00011,113,020

As a fraction of 1001,111,302/100

Read another way

As seconds12 days, 20 hours and 41 minutes

As bytes1.06 MiB

As a 24-bit colour#10F506

Keep nerding

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