Base | Representation |
---|---|
bin | 100101001110011001110… |
… | …0111111100111011001001 |
3 | 200010002201211112100120012 |
4 | 1022130303213330323021 |
5 | 1132310410033120323 |
6 | 14514200445041305 |
7 | 1035426341556215 |
oct | 112346347747311 |
9 | 20102654470505 |
10 | 5116172160713 |
11 | 16a2835896339 |
12 | 6a766b856235 |
13 | 2b15b7217873 |
14 | 1398a4591945 |
15 | 8d13b60c678 |
hex | 4a7339fcec9 |
5116172160713 has 4 divisors (see below), whose sum is σ = 5119608140820. Its totient is φ = 5112736180608.
The previous prime is 5116172160703. The next prime is 5116172160763. The reversal of 5116172160713 is 3170612716115.
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 1646774193289 + 3469397967424 = 1283267^2 + 1862632^2 .
It is a cyclic number.
It is not a de Polignac number, because 5116172160713 - 218 = 5116171898569 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5116172160703) 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, 1717987820 + ... + 1717990797.
It is an arithmetic number, because the mean of its divisors is an integer number (1279902035205).
Almost surely, 25116172160713 is an apocalyptic number.
It is an amenable number.
5116172160713 is a deficient number, since it is larger than the sum of its proper divisors (3435980107).
5116172160713 is a wasteful number, since it uses less digits than its factorization.
5116172160713 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3435980106.
The product of its (nonzero) digits is 52920, while the sum is 41.
Adding to 5116172160713 its reverse (3170612716115), we get a palindrome (8286784876828).
The spelling of 5116172160713 in words is "five trillion, one hundred sixteen billion, one hundred seventy-two million, one hundred sixty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •