Base | Representation |
---|---|
bin | 100101011100100010000… |
… | …0001111000010100010101 |
3 | 200020000001021121012220222 |
4 | 1022321010001320110111 |
5 | 1133310024103222432 |
6 | 14540135224404125 |
7 | 1040552240415512 |
oct | 112710401702425 |
9 | 20200037535828 |
10 | 5146512164117 |
11 | 1704694a46a15 |
12 | 6b1518616645 |
13 | 2b4410b759bc |
14 | 13b141c24309 |
15 | 8dd14ee8112 |
hex | 4ae44078515 |
5146512164117 has 4 divisors (see below), whose sum is σ = 5256012422976. Its totient is φ = 5037011905260.
The previous prime is 5146512164107. The next prime is 5146512164159. The reversal of 5146512164117 is 7114612156415.
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 a de Polignac number, because none of the positive numbers 2k-5146512164117 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5146512164107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54750129359 + ... + 54750129452.
It is an arithmetic number, because the mean of its divisors is an integer number (1314003105744).
Almost surely, 25146512164117 is an apocalyptic number.
It is an amenable number.
5146512164117 is a deficient number, since it is larger than the sum of its proper divisors (109500258859).
5146512164117 is a wasteful number, since it uses less digits than its factorization.
5146512164117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109500258858.
The product of its digits is 201600, while the sum is 44.
The spelling of 5146512164117 in words is "five trillion, one hundred forty-six billion, five hundred twelve million, one hundred sixty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •