Recognised as Number
1,108,337
- Positive
- Odd
- Prime
- 7 digits
1,108,337 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value1,108,337
Digit count7
Digit sum23
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 factorisation1,108,337
Distinct prime factors11,108,337
Number of divisors2
Sum of divisors σ(n)1,108,338
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)1,108,336integers below n that share no factor with it
Carmichael function λ(n)1,108,336the smallest exponent with aˣ ≡ 1 for every unit coprime to n
Möbius function μ(n)−11 distinct prime factor, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 1,108,3372 in total
Arithmetic
Previous number1,108,336
Next number1,108,338
Double2,216,674
Half554,168.5
Square1,228,410,905,569
Cube1,361,493,257,845,628,753
Square root1,052.775854586≈irrational, shown to 9 decimal places
Cube root103.488146946≈
Negation-1,108,337
Reciprocal9.02252654 × 10^-7≈
Representations
Decimal1,108,337
Binary10000111010010111000121 bits
Octal4164561
Hexadecimal10E971
Base 36NR75
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsone million, one hundred and eight thousand, three hundred and thirty-seven
Ordinalone million, one hundred and eight thousand, three hundred and thirty-seventh
Scientific notation1.108337 × 10^6
Engineering notation1.108337 × 10^6
In other bases
Ternary2002022100112base 3; the most digit-efficient integer base after e: 13 digits
Quinary240431322base 5; one hand: 9 digits
Septenary12264206base 7: 8 digits
Nonary2068315base 9; each digit is two ternary digits: 7 digits
Duodecimal455495base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal6iaghbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal5:7:52:17base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T01T10T101TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100010011111010110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000100001110100101110001
Bit length21 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits11within that length
Bit parityeven10 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 e9 71
Gray code110001001110111001001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000100001110100101110001
64-bit0000000000000000000000000000000000000000000100001110100101110001
One's complement11111111111011110001011010001110at 32 bits, every bit flipped
Bits reversed10001110100101110000100000000000at 32 bits
Rotated left by 100000000001000011101001011100010at 32 bits, wrapping
Shifted left by 11000011101001011100010= 2,216,674, no wrap
Shifted right by 110000111010010111000= 554,168, discarding the low bit
These bits as a double5.47591236 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
1,108,337 to the power 21,228,410,905,569
1,108,337 to the power 31,361,493,257,845,628,753
1,108,337 to the power 41,508,993,352,920,850,635,213,761
1,108,337 to the power 51,672,473,165,796,236,830,480,914,225,457
First ten multiples1,108,337, 2,216,674, 3,325,011, 4,433,348, 5,541,685, 6,650,022, 7,758,359, 8,866,696, 9,975,033, 11,083,370
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 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
Collatz (3n + 1) trajectory
Steps to reach 1147the total stopping time
Highest value reached3,325,0123× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps1,108,337 → 3,325,012 → 1,662,506 → 831,253 → 2,493,760 → 1,246,880 → 623,440 → 311,720 → 155,860 → 77,930 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage110,833,700%
1,108,337% as a decimal11,083.37
1,108,337% of 1001,108,337
1,108,337% of 1,00011,083,370
As a fraction of 1001,108,337/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,337
Nerdulate something else
Nothing in mind? Surprise me · today’s page