Recognised as Number
2,115,979
- Positive
- Odd
- Prime
- 7 digits
2,115,979 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,115,979
Digit count7
Digit sum34
Digit product5,670
Multiplicative persistence2times 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 factorisation2,115,979
Distinct prime factors12,115,979
Number of divisors2
Sum of divisors σ(n)2,115,980
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,115,978integers below n that share no factor with it
Carmichael function λ(n)2,115,978the 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,115,9792 in total
Arithmetic
Previous number2,115,978
Next number2,115,980
Double4,231,958
Half1,057,989.5
Square4,477,367,128,441
Cube9,474,014,819,071,458,739
Square root1,454.640505417≈irrational, shown to 9 decimal places
Cube root128.381895753≈
Negation-2,115,979
Reciprocal4.72594482 × 10^-7≈
Representations
Decimal2,115,979
Binary100000010010011000101122 bits
Octal10044613
Hexadecimal20498B
Base 3619CP7
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and fifteen thousand, nine hundred and seventy-nine
Ordinaltwo million, one hundred and fifteen thousand, nine hundred and seventy-ninth
Scientific notation2.115979 × 10^6
Engineering notation2.115979 × 10^6
In other bases
Ternary10222111120121base 3; the most digit-efficient integer base after e: 14 digits
Quinary1020202404base 5; one hand: 10 digits
Septenary23662015base 7: 8 digits
Nonary3874517base 9; each digit is two ternary digits: 7 digits
Duodecimal860637base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimald49ijbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal9:47:46:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary11000TTTTT1TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000101111010011111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000000100100110001011
Bit length22 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits14within that length
Bit parityeven8 set bits, so even; 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 49 8b
Gray code1100000110110101001110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000000100100110001011
64-bit0000000000000000000000000000000000000000001000000100100110001011
One's complement11111111110111111011011001110100at 32 bits, every bit flipped
Bits reversed11010001100100100000010000000000at 32 bits
Rotated left by 100000000010000001001001100010110at 32 bits, wrapping
Shifted left by 110000001001001100010110= 4,231,958, no wrap
Shifted right by 1100000010010011000101= 1,057,989, discarding the low bit
These bits as a double1.04543253 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,115,979 to the power 24,477,367,128,441
2,115,979 to the power 39,474,014,819,071,458,739
2,115,979 to the power 420,046,816,402,844,006,191,090,481
2,115,979 to the power 542,418,642,525,273,457,376,217,444,895,899
First ten multiples2,115,979, 4,231,958, 6,347,937, 8,463,916, 10,579,895, 12,695,874, 14,811,853, 16,927,832, 19,043,811, 21,159,790
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 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 3
Divisible by 9No, remainder 7
Divisible by 10No, remainder 9
Divisible by 11No, remainder 8
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1179the total stopping time
Highest value reached9,521,9084× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,115,979 → 6,347,938 → 3,173,969 → 9,521,908 → 4,760,954 → 2,380,477 → 7,141,432 → 3,570,716 → 1,785,358 → 892,679 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage211,597,900%
2,115,979% as a decimal21,159.79
2,115,979% of 1002,115,979
2,115,979% of 1,00021,159,790
As a fraction of 1002,115,979/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,115,979
Nerdulate something else
Nothing in mind? Surprise me · today’s page