Base | Representation |
---|---|
bin | 101010110110101101100… |
… | …101100000011000100101 |
3 | 101102112110122222220210101 |
4 | 222312231211200120211 |
5 | 341222242002404401 |
6 | 10132522002024101 |
7 | 422523655344565 |
oct | 52665545403045 |
9 | 11375418886711 |
10 | 2944964888101 |
11 | a35a529a4625 |
12 | 3b6906948031 |
13 | 18492a889932 |
14 | a27739a4da5 |
15 | 51912d0e101 |
hex | 2adad960625 |
2944964888101 has 4 divisors (see below), whose sum is σ = 2945779994092. Its totient is φ = 2944149782112.
The previous prime is 2944964888081. The next prime is 2944964888123. The reversal of 2944964888101 is 1018884694492.
It is a Cunningham number, because it is equal to 17160902+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1630059876 + 2943334828225 = 40374^2 + 1715615^2 .
It is a cyclic number.
It is not a de Polignac number, because 2944964888101 - 219 = 2944964363813 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2944964889101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 407547576 + ... + 407554801.
It is an arithmetic number, because the mean of its divisors is an integer number (736444998523).
Almost surely, 22944964888101 is an apocalyptic number.
It is an amenable number.
2944964888101 is a deficient number, since it is larger than the sum of its proper divisors (815105991).
2944964888101 is an equidigital number, since it uses as much as digits as its factorization.
2944964888101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 815105990.
The product of its (nonzero) digits is 31850496, while the sum is 64.
The spelling of 2944964888101 in words is "two trillion, nine hundred forty-four billion, nine hundred sixty-four million, eight hundred eighty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •