Recognised as Number
2,190,079
- Positive
- Odd
- Prime
- 7 digits
2,190,079 is an odd 7-digit integer and a prime number. It has 2 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityPrime
Absolute value2,190,079
Digit count7
Digit sum28
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,190,079
Distinct prime factors12,190,079
Number of divisors2
Sum of divisors σ(n)2,190,080
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,190,078integers below n that share no factor with it
Carmichael function λ(n)2,190,078the 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,190,0792 in total
Arithmetic
Previous number2,190,078
Next number2,190,080
Double4,380,158
Half1,095,039.5
Square4,796,446,026,241
Cube10,504,595,716,703,863,039
Square root1,479.891550081≈irrational, shown to 9 decimal places
Cube root129.863347529≈
Negation-2,190,079
Reciprocal4.56604533 × 10^-7≈
Representations
Decimal2,190,079
Binary100001011010101111111122 bits
Octal10265377
Hexadecimal216AFF
Base 361AXVJ
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, one hundred and ninety thousand and seventy-nine
Ordinaltwo million, one hundred and ninety thousand and seventy-ninth
Scientific notation2.190079 × 10^6
Engineering notation2.190079 × 10^6
In other bases
Ternary11010021020001base 3; the most digit-efficient integer base after e: 14 digits
Quinary1030040304base 5; one hand: 10 digits
Septenary24421033base 7: 8 digits
Nonary4107201base 9; each digit is two ternary digits: 7 digits
Duodecimal8974a7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalddf3jbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal10:8:21:19base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary110101T11T0001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11001101011111100000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001000010110101011111111
Bit length22 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits8within that length
Bit parityeven14 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
Bytes321 6a ff
Gray code1100011101111110000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001000010110101011111111
64-bit0000000000000000000000000000000000000000001000010110101011111111
One's complement11111111110111101001010100000000at 32 bits, every bit flipped
Bits reversed11111111010101101000010000000000at 32 bits
Rotated left by 100000000010000101101010111111110at 32 bits, wrapping
Shifted left by 110000101101010111111110= 4,380,158, no wrap
Shifted right by 1100001011010101111111= 1,095,039, discarding the low bit
These bits as a double1.0820428 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,190,079 to the power 24,796,446,026,241
2,190,079 to the power 310,504,595,716,703,863,039
2,190,079 to the power 423,005,894,482,643,079,660,590,081
2,190,079 to the power 550,384,726,382,652,473,259,985,464,006,399
First ten multiples2,190,079, 4,380,158, 6,570,237, 8,760,316, 10,950,395, 13,140,474, 15,330,553, 17,520,632, 19,710,711, 21,900,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 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 1
Divisible by 10No, remainder 9
Divisible by 11No, remainder 1
Divisible by 12No, remainder 7
Divisible by 100No, remainder 79
Collatz (3n + 1) trajectory
Steps to reach 1197the total stopping time
Highest value reached112,258,70851× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,190,079 → 6,570,238 → 3,285,119 → 9,855,358 → 4,927,679 → 14,783,038 → 7,391,519 → 22,174,558 → 11,087,279 → 33,261,838 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage219,007,900%
2,190,079% as a decimal21,900.79
2,190,079% of 1002,190,079
2,190,079% of 1,00021,900,790
As a fraction of 1002,190,079/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,190,079
Nerdulate something else
Nothing in mind? Surprise me · today’s page