Recognised as Number

1,097,005

Positive
Odd
Composite
7 digits

1,097,005 is an odd 7-digit integer and a composite number. It has 16 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,097,005

Digit count7

Digit sum22

Digit product0zero, because one of the digits is zero

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation5 × 7 × 13 × 2,411

Distinct prime factors45, 7, 13, 2,411

Number of divisors16

Sum of divisors σ(n)1,620,864

Aliquot sum523,859sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)14,460the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 694,080

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

SquarefreeYesno repeated prime factor

All divisors1, 5, 7, 13, 35, 65, 91, 455, 2,411, 12,055, 16,877, 31,343, 84,385, 156,715, 219,401, 1,097,00516 in total

Arithmetic

Previous number1,097,004

Next number1,097,006

Double2,194,010

Half548,502.5

Square1,203,419,970,025

Cube1,320,157,724,217,275,125

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

Cube root103.134239148≈

Negation-1,097,005

Reciprocal9.11572873 × 10^-7≈

Representations

Decimal1,097,005

Binary10000101111010010110121 bits

Octal4136455

Hexadecimal10BD2D

Base 36NIGD

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

In wordsone million, ninety-seven thousand and five

Ordinalone million, ninety-seven thousand and fifth

Scientific notation1.097005 × 10^6

Engineering notation1.097005 × 10^6

In other bases

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

Quinary240101010base 5; one hand: 9 digits

Septenary12216160base 7: 8 digits

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

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

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

Sexagesimal5:4:43:25base 60; Babylonian, and still how an hour and a circle are divided: 4 digits

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

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

Bit-level

00000000000100001011110100101101

Bit length21 bitsto write the magnitude

Set bits11the population count, or Hamming weight

Zero bits10within that length

Bit parityodd11 set bits, so odd; 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 bd 2d

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

At each machine width

32-bit00000000000100001011110100101101

64-bit0000000000000000000000000000000000000000000100001011110100101101

One's complement11111111111011110100001011010010at 32 bits, every bit flipped

Bits reversed10110100101111010000100000000000at 32 bits

Rotated left by 100000000001000010111101001011010at 32 bits, wrapping

Shifted left by 11000010111101001011010= 2,194,010, no wrap

Shifted right by 110000101111010010110= 548,502, discarding the low bit

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

Nearest landmarks

Next prime1,097,009+4

Previous prime1,096,999−6

Distance to nearest prime4

Nearest square below1,096,209

Nearest square above1,098,304

Powers & multiples

1,097,005 to the power 21,203,419,970,025

1,097,005 to the power 31,320,157,724,217,275,125

1,097,005 to the power 41,448,219,624,254,971,898,500,625

1,097,005 to the power 51,588,704,168,905,825,447,514,678,128,125

First ten multiples1,097,005, 2,194,010, 3,291,015, 4,388,020, 5,485,025, 6,582,030, 7,679,035, 8,776,040, 9,873,045, 10,970,050

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5Yes

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 4

Divisible by 10No, remainder 5

Divisible by 11No, remainder 8

Divisible by 12No, remainder 1

Divisible by 100No, remainder 5

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached3,291,0163× the starting value

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

First steps1,097,005 → 3,291,016 → 1,645,508 → 822,754 → 411,377 → 1,234,132 → 617,066 → 308,533 → 925,600 → 462,800 → …

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

As a percentage & fraction

As a percentage109,700,500%

1,097,005% as a decimal10,970.05

1,097,005% of 1001,097,005

1,097,005% of 1,00010,970,050

As a fraction of 1001,097,005/100

Read another way

As seconds12 days, 16 hours and 43 minutes

As bytes1.046 MiB

As a 24-bit colour#10BD2D

Keep nerding

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