Base | Representation |
---|---|
bin | 101011011001100111010… |
… | …000010000000111000001 |
3 | 101120010012100022101112010 |
4 | 223121213100100013001 |
5 | 342331014020220321 |
6 | 10202040331323133 |
7 | 425321430315060 |
oct | 53314720200701 |
9 | 11503170271463 |
10 | 2982439616961 |
11 | a4a933459022 |
12 | 402024bb04a9 |
13 | 1883207022cc |
14 | a44caa241d7 |
15 | 528a7c77676 |
hex | 2b6674101c1 |
2982439616961 has 16 divisors (see below), whose sum is σ = 4641364998144. Its totient is φ = 1667990545104.
The previous prime is 2982439616953. The next prime is 2982439616963. The reversal of 2982439616961 is 1696169342892.
It is not a de Polignac number, because 2982439616961 - 23 = 2982439616953 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2982439616892 and 2982439616901.
It is not an unprimeable number, because it can be changed into a prime (2982439616963) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1510860015 + ... + 1510861988.
It is an arithmetic number, because the mean of its divisors is an integer number (290085312384).
Almost surely, 22982439616961 is an apocalyptic number.
2982439616961 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2982439616961 is a deficient number, since it is larger than the sum of its proper divisors (1658925381183).
2982439616961 is a wasteful number, since it uses less digits than its factorization.
2982439616961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3021722060.
The product of its digits is 60466176, while the sum is 66.
The spelling of 2982439616961 in words is "two trillion, nine hundred eighty-two billion, four hundred thirty-nine million, six hundred sixteen thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •