Recognised as Number

1,120,902

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,120,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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 127 × 1,471

Distinct prime factors42, 3, 127, 1,471

Number of divisors16

Sum of divisors σ(n)2,260,992

Aliquot sum1,140,090sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)4,410the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 370,440

Möbius function μ(n)+14 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 6, 127, 254, 381, 762, 1,471, 2,942, 4,413, 8,826, 186,817, 373,634, 560,451, 1,120,90216 in total

Arithmetic

Previous number1,120,901

Next number1,120,903

Double2,241,804

Half560,451

Square1,256,421,293,604

Cube1,408,325,140,843,310,808

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

Cube root103.877753304≈

Negation-1,120,902

Reciprocal8.92138653 × 10^-7≈

Representations

Decimal1,120,902

Binary10001000110101000011021 bits

Octal4215206

Hexadecimal111A86

Base 36O0W6

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

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

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

Scientific notation1.120902 × 10^6

Engineering notation1.120902 × 10^6

In other bases

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

Quinary241332102base 5; one hand: 9 digits

Septenary12345636base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100010001101010000110

Bit length21 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits13within that length

Bit parityeven8 set bits, so even; 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

Bytes311 1a 86

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

At each machine width

32-bit00000000000100010001101010000110

64-bit0000000000000000000000000000000000000000000100010001101010000110

One's complement11111111111011101110010101111001at 32 bits, every bit flipped

Bits reversed01100001010110001000100000000000at 32 bits

Rotated left by 100000000001000100011010100001100at 32 bits, wrapping

Shifted left by 11000100011010100001100= 2,241,804, no wrap

Shifted right by 110001000110101000011= 560,451, discarding the low bit

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

Nearest landmarks

Next prime1,120,907+5

Previous prime1,120,901−1

Distance to nearest prime1

Nearest square below1,119,364

Nearest square above1,121,481

Powers & multiples

1,120,902 to the power 21,256,421,293,604

1,120,902 to the power 31,408,325,140,843,310,808

1,120,902 to the power 41,578,594,467,021,548,771,308,816

1,120,902 to the power 51,769,449,695,273,388,060,857,594,472,032

First ten multiples1,120,902, 2,241,804, 3,362,706, 4,483,608, 5,604,510, 6,725,412, 7,846,314, 8,967,216, 10,088,118, 11,209,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 6

Divisible by 8No, remainder 6

Divisible by 9No, remainder 6

Divisible by 10No, remainder 2

Divisible by 11No, remainder 2

Divisible by 12No, remainder 6

Divisible by 100No, remainder 2

Collatz (3n + 1) trajectory

Steps to reach 1134the total stopping time

Highest value reached2,522,0322× the starting value

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

First steps1,120,902 → 560,451 → 1,681,354 → 840,677 → 2,522,032 → 1,261,016 → 630,508 → 315,254 → 157,627 → 472,882 → …

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

As a percentage & fraction

As a percentage112,090,200%

1,120,902% as a decimal11,209.02

1,120,902% of 1001,120,902

1,120,902% of 1,00011,209,020

As a fraction of 1001,120,902/100

Read another way

As seconds12 days, 23 hours and 21 minutes

As bytes1.069 MiB

As a 24-bit colour#111A86

Keep nerding

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