Base | Representation |
---|---|
bin | 100101010111101001111… |
… | …1010110100111000011011 |
3 | 200012000000112212211220100 |
4 | 1022233103322310320123 |
5 | 1133122103040113001 |
6 | 14531244222230443 |
7 | 1040031615002064 |
oct | 112572372647033 |
9 | 20160015784810 |
10 | 5136041332251 |
11 | 1700201487a65 |
12 | 6ab495a25423 |
13 | 2b34327768bb |
14 | 13a82b33d56b |
15 | 8d900b34586 |
hex | 4abd3eb4e1b |
5136041332251 has 12 divisors (see below), whose sum is σ = 7418996704080. Its totient is φ = 3423902784720.
The previous prime is 5136041332231. The next prime is 5136041332271. The reversal of 5136041332251 is 1522331406315.
5136041332251 is a `hidden beast` number, since 5 + 1 + 3 + 604 + 13 + 32 + 2 + 5 + 1 = 666.
It is an interprime number because it is at equal distance from previous prime (5136041332231) and next prime (5136041332271).
It is not a de Polignac number, because 5136041332251 - 227 = 5135907114523 is a prime.
It is not an unprimeable number, because it can be changed into a prime (5136041332211) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10136460 + ... + 10631081.
It is an arithmetic number, because the mean of its divisors is an integer number (618249725340).
Almost surely, 25136041332251 is an apocalyptic number.
5136041332251 is a deficient number, since it is larger than the sum of its proper divisors (2282955371829).
5136041332251 is a wasteful number, since it uses less digits than its factorization.
5136041332251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20795026 (or 20795023 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 5136041332251 its reverse (1522331406315), we get a palindrome (6658372738566).
The spelling of 5136041332251 in words is "five trillion, one hundred thirty-six billion, forty-one million, three hundred thirty-two thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •