Recognised as Number

1,097,393

Positive
Odd
Composite
7 digits

1,097,393 is an odd 7-digit integer and a composite number. It has 8 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value1,097,393

Digit count7

Digit sum32

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 67 × 1,489

Distinct prime factors311, 67, 1,489

Number of divisors8

Sum of divisors σ(n)1,215,840

Aliquot sum118,447sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 11, 67, 737, 1,489, 16,379, 99,763, 1,097,3938 in total

Arithmetic

Previous number1,097,392

Next number1,097,394

Double2,194,786

Half548,696.5

Square1,204,271,396,449

Cube1,321,559,000,563,357,457

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

Cube root103.146396907≈

Negation-1,097,393

Reciprocal9.11250573 × 10^-7≈

Representations

Decimal1,097,393

Binary10000101111101011000121 bits

Octal4137261

Hexadecimal10BEB1

Base 36NIR5

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

In wordsone million, ninety-seven thousand, three hundred and ninety-three

Ordinalone million, ninety-seven thousand, three hundred and ninety-third

Scientific notation1.097393 × 10^6

Engineering notation1.097393 × 10^6

In other bases

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

Quinary240104033base 5; one hand: 9 digits

Septenary12220253base 7: 8 digits

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

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

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

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

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

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

Bit-level

00000000000100001011111010110001

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 be b1

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

At each machine width

32-bit00000000000100001011111010110001

64-bit0000000000000000000000000000000000000000000100001011111010110001

One's complement11111111111011110100000101001110at 32 bits, every bit flipped

Bits reversed10001101011111010000100000000000at 32 bits

Rotated left by 100000000001000010111110101100010at 32 bits, wrapping

Shifted left by 11000010111110101100010= 2,194,786, no wrap

Shifted right by 110000101111101011000= 548,696, discarding the low bit

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

Nearest landmarks

Next prime1,097,413+20

Previous prime1,097,381−12

Distance to nearest prime12

Nearest square below1,096,209

Nearest square above1,098,304

Powers & multiples

1,097,393 to the power 21,204,271,396,449

1,097,393 to the power 31,321,559,000,563,357,457

1,097,393 to the power 41,450,269,596,305,224,529,809,601

1,097,393 to the power 51,591,515,703,098,179,262,441,347,470,193

First ten multiples1,097,393, 2,194,786, 3,292,179, 4,389,572, 5,486,965, 6,584,358, 7,681,751, 8,779,144, 9,876,537, 10,973,930

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 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 5

Divisible by 7No, remainder 3

Divisible by 8No, remainder 1

Divisible by 9No, remainder 5

Divisible by 10No, remainder 3

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 1178the total stopping time

Highest value reached3,292,1803× the starting value

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

First steps1,097,393 → 3,292,180 → 1,646,090 → 823,045 → 2,469,136 → 1,234,568 → 617,284 → 308,642 → 154,321 → 462,964 → …

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

As a percentage & fraction

As a percentage109,739,300%

1,097,393% as a decimal10,973.93

1,097,393% of 1001,097,393

1,097,393% of 1,00010,973,930

As a fraction of 1001,097,393/100

Read another way

As seconds12 days, 16 hours and 49 minutes

As bytes1.047 MiB

As a 24-bit colour#10BEB1

Keep nerding

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