Recognised as Number

1,059,092

Positive
Even
Composite
7 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,059,092

Digit count7

Digit sum26

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 numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 149 × 1,777

Distinct prime factors32, 149, 1,777

Number of divisors12

Sum of divisors σ(n)1,866,900

Aliquot sum807,808sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,776the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 525,696

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

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 149, 298, 596, 1,777, 3,554, 7,108, 264,773, 529,546, 1,059,09212 in total

Arithmetic

Previous number1,059,091

Next number1,059,093

Double2,118,184

Half529,546

Square1,121,675,864,464

Cube1,187,957,934,646,906,688

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

Cube root101.932160452≈

Negation-1,059,092

Reciprocal9.44205036 × 10^-7≈

Representations

Decimal1,059,092

Binary10000001010010001010021 bits

Octal4024424

Hexadecimal102914

Base 36MP78

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

In wordsone million, fifty-nine thousand and ninety-two

Ordinalone million, fifty-nine thousand and ninety-second

Scientific notation1.059092 × 10^6

Engineering notation1.059092 × 10^6

In other bases

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

Quinary232342332base 5; one hand: 9 digits

Septenary12000506base 7: 8 digits

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

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

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

Sexagesimal4:54:11:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100000010100100010100

Bit length21 bitsto write the magnitude

Set bits6the population count, or Hamming weight

Zero bits15within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 22 trailing zeros

Power of twoNo

Bytes310 29 14

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

At each machine width

32-bit00000000000100000010100100010100

64-bit0000000000000000000000000000000000000000000100000010100100010100

One's complement11111111111011111101011011101011at 32 bits, every bit flipped

Bits reversed00101000100101000000100000000000at 32 bits

Rotated left by 100000000001000000101001000101000at 32 bits, wrapping

Shifted left by 11000000101001000101000= 2,118,184, no wrap

Shifted right by 110000001010010001010= 529,546, discarding the low bit

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

Nearest landmarks

Next prime1,059,103+11

Previous prime1,059,077−15

Distance to nearest prime11

Nearest square below1,058,841

Nearest square above1,060,900

Powers & multiples

1,059,092 to the power 21,121,675,864,464

1,059,092 to the power 31,187,957,934,646,906,688

1,059,092 to the power 41,258,156,744,921,061,698,007,296

1,059,092 to the power 51,332,503,743,291,937,075,865,943,135,232

First ten multiples1,059,092, 2,118,184, 3,177,276, 4,236,368, 5,295,460, 6,354,552, 7,413,644, 8,472,736, 9,531,828, 10,590,920

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 4Yes

Divisible by 5No, remainder 2

Divisible by 6No, remainder 2

Divisible by 7No, remainder 6

Divisible by 8No, remainder 4

Divisible by 9No, remainder 8

Divisible by 10No, remainder 2

Divisible by 11No, remainder 1

Divisible by 12No, remainder 8

Divisible by 100No, remainder 92

Collatz (3n + 1) trajectory

Steps to reach 1103the total stopping time

Highest value reached1,059,092

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

First steps1,059,092 → 529,546 → 264,773 → 794,320 → 397,160 → 198,580 → 99,290 → 49,645 → 148,936 → 74,468 → …

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

As a percentage & fraction

As a percentage105,909,200%

1,059,092% as a decimal10,590.92

1,059,092% of 1001,059,092

1,059,092% of 1,00010,590,920

As a fraction of 1001,059,092/100

Read another way

As seconds12 days, 6 hours and 11 minutes

As bytes1.01 MiB

As a 24-bit colour#102914

Keep nerding

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