Recognised as Number

1,083,090

Positive
Even
Composite
7 digits

1,083,090 is an even 7-digit integer and a composite number. It has 32 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value1,083,090

Digit count7

Digit sum21

Digit product0zero, because one of the digits is zero

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 3 × 5 × 79 × 457

Distinct prime factors52, 3, 5, 79, 457

Number of divisors32

Sum of divisors σ(n)2,638,080

Aliquot sum1,554,990sum of the proper divisors

ClassificationAbundantthe aliquot sum exceeds the number

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

Carmichael function λ(n)5,928the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 284,544

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 3, 5, 6, 10, 15, 30, 79, 158, 237, 395, 457, 474, 790, 914, 1,185, 1,371, 2,285, 2,370, 2,742, 4,570, 6,855, 13,710, 36,103, 72,206, 108,309, 180,515, 216,618, 361,030, 541,545, 1,083,09032 in total

Arithmetic

Previous number1,083,089

Next number1,083,091

Double2,166,180

Half541,545

Square1,173,083,948,100

Cube1,270,555,493,347,629,000

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

Cube root102.696312254≈

Negation-1,083,090

Reciprocal9.23284307 × 10^-7≈

Representations

Decimal1,083,090

Binary10000100001101101001021 bits

Octal4103322

Hexadecimal1086D2

Base 36N7PU

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

In wordsone million, eighty-three thousand and ninety

Ordinalone million, eighty-three thousand and ninetieth

Scientific notation1.08309 × 10^6

Engineering notation1.08309 × 10^6

In other bases

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

Quinary234124330base 5; one hand: 9 digits

Septenary12130461base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001000011011010010

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 86 d2

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

At each machine width

32-bit00000000000100001000011011010010

64-bit0000000000000000000000000000000000000000000100001000011011010010

One's complement11111111111011110111100100101101at 32 bits, every bit flipped

Bits reversed01001011011000010000100000000000at 32 bits

Rotated left by 100000000001000010000110110100100at 32 bits, wrapping

Shifted left by 11000010000110110100100= 2,166,180, no wrap

Shifted right by 110000100001101101001= 541,545, discarding the low bit

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

Nearest landmarks

Next prime1,083,107+17

Previous prime1,083,083−7

Distance to nearest prime7

Nearest square below1,081,600

Nearest square above1,083,681

Powers & multiples

1,083,090 to the power 21,173,083,948,100

1,083,090 to the power 31,270,555,493,347,629,000

1,083,090 to the power 41,376,125,949,289,883,493,610,000

1,083,090 to the power 51,490,468,254,416,379,913,094,054,900,000

First ten multiples1,083,090, 2,166,180, 3,249,270, 4,332,360, 5,415,450, 6,498,540, 7,581,630, 8,664,720, 9,747,810, 10,830,900

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

Divisible by 6Yes

Divisible by 7No, remainder 1

Divisible by 8No, remainder 2

Divisible by 9No, remainder 3

Divisible by 10Yes

Divisible by 11No, remainder 8

Divisible by 12No, remainder 6

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 1253the total stopping time

Highest value reached29,642,59627× the starting value

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

First steps1,083,090 → 541,545 → 1,624,636 → 812,318 → 406,159 → 1,218,478 → 609,239 → 1,827,718 → 913,859 → 2,741,578 → …

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

As a percentage & fraction

As a percentage108,309,000%

1,083,090% as a decimal10,830.9

1,083,090% of 1001,083,090

1,083,090% of 1,00010,830,900

As a fraction of 1001,083,090/100

Read another way

As seconds12 days, 12 hours and 51 minutes

As bytes1.033 MiB

As a 24-bit colour#1086D2

Keep nerding

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