Recognised as Number
2,980,463
- Positive
- Odd
- Prime
- 7 digits
2,980,463 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 value2,980,463
Digit count7
Digit sum32
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 numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2,980,463
Distinct prime factors12,980,463
Number of divisors2
Sum of divisors σ(n)2,980,464
Aliquot sum1sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)2,980,462integers below n that share no factor with it
Carmichael function λ(n)2,980,462the 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,980,4632 in total
Arithmetic
Previous number2,980,462
Next number2,980,464
Double5,960,926
Half1,490,231.5
Square8,883,159,694,369
Cube26,475,928,792,158,112,847
Square root1,726.401749304≈irrational, shown to 9 decimal places
Cube root143.911194602≈
Negation-2,980,463
Reciprocal3.35518341 × 10^-7≈
Representations
Decimal2,980,463
Binary101101011110100110111122 bits
Octal13275157
Hexadecimal2D7A6F
Base 361RVQN
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordstwo million, nine hundred and eighty thousand, four hundred and sixty-three
Ordinaltwo million, nine hundred and eighty thousand, four hundred and sixty-third
Scientific notation2.980463 × 10^6
Engineering notation2.980463 × 10^6
In other bases
Ternary12121102102112base 3; the most digit-efficient integer base after e: 14 digits
Quinary1230333323base 5; one hand: 10 digits
Septenary34222253base 7: 8 digits
Nonary5542375base 9; each digit is two ternary digits: 7 digits
Duodecimalbb897bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimalicb33base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal13:47:54:23base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternary1T0TT111T110TTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11100101000111110110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000001011010111101001101111
Bit length22 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits7within that length
Bit parityodd15 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 7a 6f
Gray code1110111100011101011000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000001011010111101001101111
64-bit0000000000000000000000000000000000000000001011010111101001101111
One's complement11111111110100101000010110010000at 32 bits, every bit flipped
Bits reversed11110110010111101011010000000000at 32 bits
Rotated left by 100000000010110101111010011011110at 32 bits, wrapping
Shifted left by 110110101111010011011110= 5,960,926, no wrap
Shifted right by 1101101011110100110111= 1,490,231, discarding the low bit
These bits as a double1.47254438 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
2,980,463 to the power 28,883,159,694,369
2,980,463 to the power 326,475,928,792,158,112,847
2,980,463 to the power 478,910,526,155,661,945,490,308,161
2,980,463 to the power 5235,189,903,517,482,669,041,880,332,458,543
First ten multiples2,980,463, 5,960,926, 8,941,389, 11,921,852, 14,902,315, 17,882,778, 20,863,241, 23,843,704, 26,824,167, 29,804,630
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 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 3
Divisible by 11No, remainder 2
Divisible by 12No, remainder 11
Divisible by 100No, remainder 63
Collatz (3n + 1) trajectory
Steps to reach 1164the total stopping time
Highest value reached220,488,96473× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps2,980,463 → 8,941,390 → 4,470,695 → 13,412,086 → 6,706,043 → 20,118,130 → 10,059,065 → 30,177,196 → 15,088,598 → 7,544,299 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage298,046,300%
2,980,463% as a decimal29,804.63
2,980,463% of 1002,980,463
2,980,463% of 1,00029,804,630
As a fraction of 1002,980,463/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,980,463
Nerdulate something else
Nothing in mind? Surprise me · today’s page