Recognised as Number
1,108,342
- Positive
- Even
- Composite
- 7 digits
1,108,342 is an even 7-digit integer and a composite number. It has 4 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value1,108,342
Digit count7
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 554,171
Distinct prime factors22, 554,171
Number of divisors4
Sum of divisors σ(n)1,662,516
Aliquot sum554,174sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)554,170integers below n that share no factor with it
Carmichael function λ(n)554,170the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)+12 distinct prime factors, an even number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 554,171, 1,108,3424 in total
Arithmetic
Previous number1,108,341
Next number1,108,343
Double2,216,684
Half554,171
Square1,228,421,988,964
Cube1,361,511,684,092,337,688
Square root1,052.778229258≈irrational, shown to 9 decimal places
Cube root103.488302567≈
Negation-1,108,342
Reciprocal9.02248584 × 10^-7≈
Representations
Decimal1,108,342
Binary10000111010010111011021 bits
Octal4164566
Hexadecimal10E976
Base 36NR7A
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eight thousand, three hundred and forty-two
Ordinalone million, one hundred and eight thousand, three hundred and forty-second
Scientific notation1.108342 × 10^6
Engineering notation1.108342 × 10^6
In other bases
Ternary2002022100201base 3; the most digit-efficient integer base after e: 13 digits
Quinary240431332base 5; one hand: 9 digits
Septenary12264214base 7: 8 digits
Nonary2068321base 9; each digit is two ternary digits: 7 digits
Duodecimal45549abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6iah2base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:7:52:22base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T10T101T01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010011111010001010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001110100101110110
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 even
Highest set bitbit 20worth 1,048,576
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes310 e9 76
Gray code110001001110111001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001110100101110110
64-bit0000000000000000000000000000000000000000000100001110100101110110
One's complement11111111111011110001011010001001at 32 bits, every bit flipped
Bits reversed01101110100101110000100000000000at 32 bits
Rotated left by 100000000001000011101001011101100at 32 bits, wrapping
Shifted left by 11000011101001011101100= 2,216,684, no wrap
Shifted right by 110000111010010111011= 554,171, discarding the low bit
These bits as a double5.47593706 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,108,342 to the power 21,228,421,988,964
1,108,342 to the power 31,361,511,684,092,337,688
1,108,342 to the power 41,509,020,582,970,269,737,793,296
1,108,342 to the power 51,672,510,890,970,434,701,725,297,275,232
First ten multiples1,108,342, 2,216,684, 3,325,026, 4,433,368, 5,541,710, 6,650,052, 7,758,394, 8,866,736, 9,975,078, 11,083,420
Powers of twoBetween 2^20 (1,048,576) and 2^21 (2,097,152)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 1
Divisible by 10No, remainder 2
Divisible by 11No, remainder 4
Divisible by 12No, remainder 10
Divisible by 100No, remainder 42
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,342 → 554,171 → 1,662,514 → 831,257 → 2,493,772 → 1,246,886 → 623,443 → 1,870,330 → 935,165 → 2,805,496 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,834,200%
1,108,342% as a decimal11,083.42
1,108,342% of 1001,108,342
1,108,342% of 1,00011,083,420
As a fraction of 1001,108,342/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,342
Nerdulate something else
Nothing in mind? Surprise me · today’s page