Recognised as Number
2,118,703
- Positive
- Odd
- Prime
- 7 digits
2,118,703 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,118,703
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 factorisation2,118,703
Distinct prime factors12,118,703
Number of divisors2
Sum of divisors σ(n)2,118,704
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,118,702integers below n that share no factor with it
Carmichael function λ(n)2,118,702the 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, 2,118,7032 in total
Arithmetic
Previous number2,118,702
Next number2,118,704
Double4,237,406
Half1,059,351.5
Square4,488,902,402,209
Cube9,510,650,986,267,414,927
Square root1,455.576518085≈irrational, shown to 9 decimal places
Cube root128.436962829≈
Negation-2,118,703
Reciprocal4.71986871 × 10^-7≈
Representations
Decimal2,118,703
Binary100000010101000010111122 bits
Octal10052057
Hexadecimal20542F
Base 3619ESV
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and eighteen thousand, seven hundred and three
Ordinaltwo million, one hundred and eighteen thousand, seven hundred and third
Scientific notation2.118703 × 10^6
Engineering notation2.118703 × 10^6
In other bases
Ternary10222122022111base 3; the most digit-efficient integer base after e: 14 digits
Quinary1020244303base 5; one hand: 10 digits
Septenary24002656base 7: 8 digits
Nonary3878274base 9; each digit is two ternary digits: 7 digits
Duodecimal862127base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald4gf3base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:48:31:43base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000T0T10T111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000101010001110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000101010000101111
Bit length22 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits13within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 21worth 2,097,152
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes320 54 2f
Gray code1100000111111000111000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000101010000101111
64-bit0000000000000000000000000000000000000000001000000101010000101111
One's complement11111111110111111010101111010000at 32 bits, every bit flipped
Bits reversed11110100001010100000010000000000at 32 bits
Rotated left by 100000000010000001010100001011110at 32 bits, wrapping
Shifted left by 110000001010100001011110= 4,237,406, no wrap
Shifted right by 1100000010101000010111= 1,059,351, discarding the low bit
These bits as a double1.04677837 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,118,703 to the power 24,488,902,402,209
2,118,703 to the power 39,510,650,986,267,414,927
2,118,703 to the power 420,150,244,776,557,730,808,079,681
2,118,703 to the power 542,692,384,058,827,193,936,270,844,373,743
First ten multiples2,118,703, 4,237,406, 6,356,109, 8,474,812, 10,593,515, 12,712,218, 14,830,921, 16,949,624, 19,068,327, 21,187,030
Powers of twoBetween 2^21 (2,097,152) and 2^22 (4,194,304)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 3
Divisible by 11No, remainder 4
Divisible by 12No, remainder 7
Divisible by 100No, remainder 3
Collatz (3n + 1) trajectory
Steps to reach 1179the total stopping time
Highest value reached352,659,904166× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,118,703 → 6,356,110 → 3,178,055 → 9,534,166 → 4,767,083 → 14,301,250 → 7,150,625 → 21,451,876 → 10,725,938 → 5,362,969 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage211,870,300%
2,118,703% as a decimal21,187.03
2,118,703% of 1002,118,703
2,118,703% of 1,00021,187,030
As a fraction of 1002,118,703/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 2,118,703
Nerdulate something else
Nothing in mind? Surprise me · today’s page