Recognised as Number
1,108,339
- Positive
- Odd
- Composite
- 7 digits
1,108,339 is an odd 7-digit integer and a composite number. It has 4 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value1,108,339
Digit count7
Digit sum25
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation953 × 1,163
Distinct prime factors2953, 1,163
Number of divisors4
Sum of divisors σ(n)1,110,456
Aliquot sum2,117sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,106,224integers below n that share no factor with it
Carmichael function λ(n)79,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 1,106,224
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 953, 1,163, 1,108,3394 in total
Arithmetic
Previous number1,108,338
Next number1,108,340
Double2,216,678
Half554,169.5
Square1,228,415,338,921
Cube1,361,500,628,324,362,219
Square root1,052.776804456≈irrational, shown to 9 decimal places
Cube root103.488209195≈
Negation-1,108,339
Reciprocal9.02251026 × 10^-7≈
Representations
Decimal1,108,339
Binary10000111010010111001121 bits
Octal4164563
Hexadecimal10E973
Base 36NR77
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eight thousand, three hundred and thirty-nine
Ordinalone million, one hundred and eight thousand, three hundred and thirty-ninth
Scientific notation1.108339 × 10^6
Engineering notation1.108339 × 10^6
In other bases
Ternary2002022100121base 3; the most digit-efficient integer base after e: 13 digits
Quinary240431324base 5; one hand: 9 digits
Septenary12264211base 7: 8 digits
Nonary2068317base 9; each digit is two ternary digits: 7 digits
Duodecimal455497base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6iagjbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:7:52:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T10T101TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010011111010110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001110100101110011
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 e9 73
Gray code110001001110111001010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001110100101110011
64-bit0000000000000000000000000000000000000000000100001110100101110011
One's complement11111111111011110001011010001100at 32 bits, every bit flipped
Bits reversed11001110100101110000100000000000at 32 bits
Rotated left by 100000000001000011101001011100110at 32 bits, wrapping
Shifted left by 11000011101001011100110= 2,216,678, no wrap
Shifted right by 110000111010010111001= 554,169, discarding the low bit
These bits as a double5.47592224 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,108,339 to the power 21,228,415,338,921
1,108,339 to the power 31,361,500,628,324,362,219
1,108,339 to the power 41,509,004,244,896,395,297,444,241
1,108,339 to the power 51,672,488,255,784,225,867,574,052,625,699
First ten multiples1,108,339, 2,216,678, 3,325,017, 4,433,356, 5,541,695, 6,650,034, 7,758,373, 8,866,712, 9,975,051, 11,083,390
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 39
Collatz (3n + 1) trajectory
Steps to reach 1191the total stopping time
Highest value reached57,586,62451× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,108,339 → 3,325,018 → 1,662,509 → 4,987,528 → 2,493,764 → 1,246,882 → 623,441 → 1,870,324 → 935,162 → 467,581 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,833,900%
1,108,339% as a decimal11,083.39
1,108,339% of 1001,108,339
1,108,339% of 1,00011,083,390
As a fraction of 1001,108,339/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 1,108,339
Nerdulate something else
Nothing in mind? Surprise me · today’s page