Base | Representation |
---|---|
bin | 1010010110110011… |
… | …1000001010001101 |
3 | 21011202001212221100 |
4 | 2211230320022031 |
5 | 21143140130010 |
6 | 1135505053313 |
7 | 125614436601 |
oct | 24554701215 |
9 | 7152055840 |
10 | 2780005005 |
11 | 11a72709a8 |
12 | 657027239 |
13 | 353c4919b |
14 | 1c52db501 |
15 | 1140da2c0 |
hex | a5b3828d |
2780005005 has 12 divisors (see below), whose sum is σ = 4818675420. Its totient is φ = 1482669312.
The previous prime is 2780004971. The next prime is 2780005049. The reversal of 2780005005 is 5005000872.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 1975091364 + 804913641 = 44442^2 + 28371^2 .
It is not a de Polignac number, because 2780005005 - 216 = 2779939469 is a prime.
2780005005 is a modest number, since divided by 5005 gives 2780 as remainder.
It is a self number, because there is not a number n which added to its sum of digits gives 2780005005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 30888900 + ... + 30888989.
It is an arithmetic number, because the mean of its divisors is an integer number (401556285).
Almost surely, 22780005005 is an apocalyptic number.
It is an amenable number.
2780005005 is a deficient number, since it is larger than the sum of its proper divisors (2038670415).
2780005005 is a wasteful number, since it uses less digits than its factorization.
2780005005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61777900 (or 61777897 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 27.
The square root of 2780005005 is about 52725.7527684527. The cubic root of 2780005005 is about 1406.0967117062.
Adding to 2780005005 its reverse (5005000872), we get a palindrome (7785005877).
The spelling of 2780005005 in words is "two billion, seven hundred eighty million, five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •