Base | Representation |
---|---|
bin | 101001001101001011011… |
… | …111011101100110111101 |
3 | 101000200222120000111222122 |
4 | 221031023133131212331 |
5 | 332343204344041010 |
6 | 10004501514252325 |
7 | 411402632520500 |
oct | 51151337354675 |
9 | 11020876014878 |
10 | 2831649987005 |
11 | 9a1994662234 |
12 | 398961a270a5 |
13 | 17703c6910b8 |
14 | 9b0a4447137 |
15 | 4d9cebbd855 |
hex | 2934b7dd9bd |
2831649987005 has 18 divisors (see below), whose sum is σ = 3952788994494. Its totient is φ = 1941684787056.
The previous prime is 2831649986939. The next prime is 2831649987007. The reversal of 2831649987005 is 5007899461382.
It can be written as a sum of positive squares in only one way, i.e., 2265319989604 + 566329997401 = 1505098^2 + 752549^2 .
It is not a de Polignac number, because 2831649987005 - 28 = 2831649986749 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2831649987007) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 26285462 + ... + 26392968.
It is an arithmetic number, because the mean of its divisors is an integer number (219599388583).
It is a 1-persistent number, because it is pandigital, but 2⋅2831649987005 = 5663299974010 is not.
Almost surely, 22831649987005 is an apocalyptic number.
It is an amenable number.
2831649987005 is a deficient number, since it is larger than the sum of its proper divisors (1121139007489).
2831649987005 is an frugal number, since it uses more digits than its factorization.
2831649987005 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 215033 (or 107519 counting only the distinct ones).
The product of its (nonzero) digits is 26127360, while the sum is 62.
The spelling of 2831649987005 in words is "two trillion, eight hundred thirty-one billion, six hundred forty-nine million, nine hundred eighty-seven thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •