Base | Representation |
---|---|
bin | 11111011011111001010… |
… | …100011011010010000101 |
3 | 21122111222222122201102212 |
4 | 133123321110123102011 |
5 | 240343201123322010 |
6 | 4332224053113205 |
7 | 312034111654523 |
oct | 37337124332205 |
9 | 7574888581385 |
10 | 2160256464005 |
11 | 763183502172 |
12 | 2aa809628805 |
13 | 128932997933 |
14 | 767b2483313 |
15 | 3b2d7229505 |
hex | 1f6f951b485 |
2160256464005 has 4 divisors (see below), whose sum is σ = 2592307756812. Its totient is φ = 1728205171200.
The previous prime is 2160256463993. The next prime is 2160256464007. The reversal of 2160256464005 is 5004646520612.
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 909547504804 + 1250708959201 = 953702^2 + 1118351^2 .
It is not a de Polignac number, because 2160256464005 - 26 = 2160256463941 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 (2160256464007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 216025646396 + ... + 216025646405.
It is an arithmetic number, because the mean of its divisors is an integer number (648076939203).
Almost surely, 22160256464005 is an apocalyptic number.
It is an amenable number.
2160256464005 is a deficient number, since it is larger than the sum of its proper divisors (432051292807).
2160256464005 is an equidigital number, since it uses as much as digits as its factorization.
2160256464005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432051292806.
The product of its (nonzero) digits is 345600, while the sum is 41.
The spelling of 2160256464005 in words is "two trillion, one hundred sixty billion, two hundred fifty-six million, four hundred sixty-four thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •