Base | Representation |
---|---|
bin | 100101001110011001001… |
… | …1100100100100110101101 |
3 | 200010002200110100102101002 |
4 | 1022130302130210212231 |
5 | 1132310340003302201 |
6 | 14514154501330045 |
7 | 1035426011605535 |
oct | 112346234444655 |
9 | 20102613312332 |
10 | 5116152400301 |
11 | 16a282571a018 |
12 | 6a7665106925 |
13 | 2b15b30b9507 |
14 | 1398a1aca4c5 |
15 | 8d139a0776b |
hex | 4a7327249ad |
5116152400301 has 4 divisors (see below), whose sum is σ = 5117792721600. Its totient is φ = 5114512079004.
The previous prime is 5116152400291. The next prime is 5116152400343. The reversal of 5116152400301 is 1030042516115.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5116152400301 - 26 = 5116152400237 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 (5116152400351) 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, 820155971 + ... + 820162208.
It is an arithmetic number, because the mean of its divisors is an integer number (1279448180400).
Almost surely, 25116152400301 is an apocalyptic number.
It is an amenable number.
5116152400301 is a deficient number, since it is larger than the sum of its proper divisors (1640321299).
5116152400301 is a wasteful number, since it uses less digits than its factorization.
5116152400301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1640321298.
The product of its (nonzero) digits is 3600, while the sum is 29.
Adding to 5116152400301 its reverse (1030042516115), we get a palindrome (6146194916416).
The spelling of 5116152400301 in words is "five trillion, one hundred sixteen billion, one hundred fifty-two million, four hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •