Recognised as Number

1,109,481

Positive
Odd
Composite
7 digits

1,109,481 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,109,481

Digit count7

Digit sum24

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

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 369,827

Distinct prime factors23, 369,827

Number of divisors4

Sum of divisors σ(n)1,479,312

Aliquot sum369,831sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)369,826the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 739,652

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 369,827, 1,109,4814 in total

Arithmetic

Previous number1,109,480

Next number1,109,482

Double2,218,962

Half554,740.5

Square1,230,948,089,361

Cube1,365,713,517,132,331,641

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

Cube root103.523740732≈

Negation-1,109,481

Reciprocal9.0132233 × 10^-7≈

Representations

Decimal1,109,481

Binary10000111011011110100121 bits

Octal4166751

Hexadecimal10EDE9

Base 36NS2X

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

In wordsone million, one hundred and nine thousand, four hundred and eighty-one

Ordinalone million, one hundred and nine thousand, four hundred and eighty-first

Scientific notation1.109481 × 10^6

Engineering notation1.109481 × 10^6

In other bases

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

Quinary241000411base 5; one hand: 9 digits

Septenary12300432base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001110110111101001

Bit length21 bitsto write the magnitude

Set bits12the population count, or Hamming weight

Zero bits9within that length

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

Highest set bitbit 20worth 1,048,576

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes310 ed e9

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

At each machine width

32-bit00000000000100001110110111101001

64-bit0000000000000000000000000000000000000000000100001110110111101001

One's complement11111111111011110001001000010110at 32 bits, every bit flipped

Bits reversed10010111101101110000100000000000at 32 bits

Rotated left by 100000000001000011101101111010010at 32 bits, wrapping

Shifted left by 11000011101101111010010= 2,218,962, no wrap

Shifted right by 110000111011011110100= 554,740, discarding the low bit

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

Nearest landmarks

Next prime1,109,489+8

Previous prime1,109,477−4

Distance to nearest prime4

Nearest square below1,108,809

Nearest square above1,110,916

Powers & multiples

1,109,481 to the power 21,230,948,089,361

1,109,481 to the power 31,365,713,517,132,331,641

1,109,481 to the power 41,515,233,198,701,496,441,388,321

1,109,481 to the power 51,681,122,444,528,534,973,287,955,771,401

First ten multiples1,109,481, 2,218,962, 3,328,443, 4,437,924, 5,547,405, 6,656,886, 7,766,367, 8,875,848, 9,985,329, 11,094,810

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 1

Divisible by 6No, remainder 3

Divisible by 7No, remainder 2

Divisible by 8No, remainder 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 1

Divisible by 11No, remainder 10

Divisible by 12No, remainder 9

Divisible by 100No, remainder 81

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached9,478,2768× the starting value

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

First steps1,109,481 → 3,328,444 → 1,664,222 → 832,111 → 2,496,334 → 1,248,167 → 3,744,502 → 1,872,251 → 5,616,754 → 2,808,377 → …

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

As a percentage & fraction

As a percentage110,948,100%

1,109,481% as a decimal11,094.81

1,109,481% of 1001,109,481

1,109,481% of 1,00011,094,810

As a fraction of 1001,109,481/100

Read another way

As seconds12 days, 20 hours and 11 minutes

As bytes1.058 MiB

As a 24-bit colour#10EDE9

Keep nerding

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