Recognised as Number

1,092,122

Positive
Even
Composite
7 digits

1,092,122 is an even 7-digit integer and a composite number. It has 8 divisors and a digital root of 8.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,092,122

Digit count7

Digit sum17

Digit product0zero, because one of the digits is zero

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 71 × 7,691

Distinct prime factors32, 71, 7,691

Number of divisors8

Sum of divisors σ(n)1,661,472

Aliquot sum569,350sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)53,830the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 538,300

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 71, 142, 7,691, 15,382, 546,061, 1,092,1228 in total

Arithmetic

Previous number1,092,121

Next number1,092,123

Double2,184,244

Half546,061

Square1,192,730,462,884

Cube1,302,607,178,585,799,848

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

Cube root102.980987473≈

Negation-1,092,122

Reciprocal9.15648618 × 10^-7≈

Representations

Decimal1,092,122

Binary10000101010100001101021 bits

Octal4125032

Hexadecimal10AA1A

Base 36NEOQ

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

In wordsone million, ninety-two thousand, one hundred and twenty-two

Ordinalone million, ninety-two thousand, one hundred and twenty-second

Scientific notation1.092122 × 10^6

Engineering notation1.092122 × 10^6

In other bases

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

Quinary234421442base 5; one hand: 9 digits

Septenary12166013base 7: 8 digits

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

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

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

Sexagesimal5:3:22:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001010101000011010

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

Bytes310 aa 1a

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

At each machine width

32-bit00000000000100001010101000011010

64-bit0000000000000000000000000000000000000000000100001010101000011010

One's complement11111111111011110101010111100101at 32 bits, every bit flipped

Bits reversed01011000010101010000100000000000at 32 bits

Rotated left by 100000000001000010101010000110100at 32 bits, wrapping

Shifted left by 11000010101010000110100= 2,184,244, no wrap

Shifted right by 110000101010100001101= 546,061, discarding the low bit

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

Nearest landmarks

Next prime1,092,127+5

Previous prime1,092,107−15

Distance to nearest prime5

Nearest square below1,092,025

Nearest square above1,094,116

Powers & multiples

1,092,122 to the power 21,192,730,462,884

1,092,122 to the power 31,302,607,178,585,799,848

1,092,122 to the power 41,422,605,957,091,480,901,597,456

1,092,122 to the power 51,553,659,263,070,662,305,214,416,841,632

First ten multiples1,092,122, 2,184,244, 3,276,366, 4,368,488, 5,460,610, 6,552,732, 7,644,854, 8,736,976, 9,829,098, 10,921,220

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 8

Divisible by 10No, remainder 2

Divisible by 11No, remainder 9

Divisible by 12No, remainder 2

Divisible by 100No, remainder 22

Collatz (3n + 1) trajectory

Steps to reach 190the total stopping time

Highest value reached1,638,1841× the starting value

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

First steps1,092,122 → 546,061 → 1,638,184 → 819,092 → 409,546 → 204,773 → 614,320 → 307,160 → 153,580 → 76,790 → …

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

As a percentage & fraction

As a percentage109,212,200%

1,092,122% as a decimal10,921.22

1,092,122% of 1001,092,122

1,092,122% of 1,00010,921,220

As a fraction of 1001,092,122/100

Read another way

As seconds12 days, 15 hours and 22 minutes

As bytes1.042 MiB

As a 24-bit colour#10AA1A

Keep nerding

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