Recognised as Number
2,979,997
- Positive
- Odd
- Prime
- 7 digits
2,979,997 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,979,997
Digit count7
Digit sum52
Digit product642,978
Multiplicative persistence5times 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,979,997
Distinct prime factors12,979,997
Number of divisors2
Sum of divisors σ(n)2,979,998
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,979,996integers below n that share no factor with it
Carmichael function λ(n)2,979,996the 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,979,9972 in total
Arithmetic
Previous number2,979,996
Next number2,979,998
Double5,959,994
Half1,489,998.5
Square8,880,382,120,009
Cube26,463,512,076,480,459,973
Square root1,726.266781236≈irrational, shown to 9 decimal places
Cube root143.903693965≈
Negation-2,979,997
Reciprocal3.35570808 × 10^-7≈
Representations
Decimal2,979,997
Binary101101011110001001110122 bits
Octal13274235
Hexadecimal2D789D
Base 361RVDP
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and seventy-nine thousand, nine hundred and ninety-seven
Ordinaltwo million, nine hundred and seventy-nine thousand, nine hundred and ninety-seventh
Scientific notation2.979997 × 10^6
Engineering notation2.979997 × 10^6
In other bases
Ternary12121101210021base 3; the most digit-efficient integer base after e: 14 digits
Quinary1230324442base 5; one hand: 10 digits
Septenary34221016base 7: 8 digits
Nonary5541707base 9; each digit is two ternary digits: 7 digits
Duodecimalbb8651base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalic9jhbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:47:46:37base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT111TT101T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100101000100111101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010111100010011101
Bit length22 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits9within that length
Bit parityodd13 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
Bytes32d 78 9d
Gray code1110111100010011010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010111100010011101
64-bit0000000000000000000000000000000000000000001011010111100010011101
One's complement11111111110100101000011101100010at 32 bits, every bit flipped
Bits reversed10111001000111101011010000000000at 32 bits
Rotated left by 100000000010110101111000100111010at 32 bits, wrapping
Shifted left by 110110101111000100111010= 5,959,994, no wrap
Shifted right by 1101101011110001001110= 1,489,998, discarding the low bit
These bits as a double1.47231414 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,979,997 to the power 28,880,382,120,009
2,979,997 to the power 326,463,512,076,480,459,973
2,979,997 to the power 478,861,186,597,375,541,278,160,081
2,979,997 to the power 5235,006,099,476,619,320,882,293,206,899,757
First ten multiples2,979,997, 5,959,994, 8,939,991, 11,919,988, 14,899,985, 17,879,982, 20,859,979, 23,839,976, 26,819,973, 29,799,970
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 5
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
Collatz (3n + 1) trajectory
Steps to reach 189the total stopping time
Highest value reached8,939,9923× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,979,997 → 8,939,992 → 4,469,996 → 2,234,998 → 1,117,499 → 3,352,498 → 1,676,249 → 5,028,748 → 2,514,374 → 1,257,187 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage297,999,700%
2,979,997% as a decimal29,799.97
2,979,997% of 1002,979,997
2,979,997% of 1,00029,799,970
As a fraction of 1002,979,997/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,979,997
Nerdulate something else
Nothing in mind? Surprise me · today’s page