Base | Representation |
---|---|
bin | 100101011110111100111… |
… | …1110000101001010001101 |
3 | 200020111110200012120221210 |
4 | 1022331321332011022031 |
5 | 1133401201244330401 |
6 | 14542355221245033 |
7 | 1041125141243352 |
oct | 112757176051215 |
9 | 20214420176853 |
10 | 5151712105101 |
11 | 17069131a6601 |
12 | 6b2529b63779 |
13 | 2b4a5c26aa63 |
14 | 13b4b6690629 |
15 | 8e01b7964d6 |
hex | 4af79f8528d |
5151712105101 has 8 divisors (see below), whose sum is σ = 6869976095584. Its totient is φ = 3433961425680.
The previous prime is 5151712105097. The next prime is 5151712105153. The reversal of 5151712105101 is 1015012171515.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5151712105101 - 22 = 5151712105097 is a prime.
It is a super-2 number, since 2×51517121051012 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5151712105301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 128304346 + ... + 128344491.
It is an arithmetic number, because the mean of its divisors is an integer number (858747011948).
Almost surely, 25151712105101 is an apocalyptic number.
It is an amenable number.
5151712105101 is a deficient number, since it is larger than the sum of its proper divisors (1718263990483).
5151712105101 is a wasteful number, since it uses less digits than its factorization.
5151712105101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 256655531.
The product of its (nonzero) digits is 1750, while the sum is 30.
Adding to 5151712105101 its reverse (1015012171515), we get a palindrome (6166724276616).
The spelling of 5151712105101 in words is "five trillion, one hundred fifty-one billion, seven hundred twelve million, one hundred five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •