Base | Representation |
---|---|
bin | 1001101111000011… |
… | …00100101010011101 |
3 | 111111020121110212101 |
4 | 10313201210222131 |
5 | 41200441440401 |
6 | 2222342205101 |
7 | 243342434233 |
oct | 46741445235 |
9 | 14436543771 |
10 | 5226515101 |
11 | 2242260175 |
12 | 101a423791 |
13 | 653a6a8b2 |
14 | 3781c6953 |
15 | 208c9c101 |
hex | 137864a9d |
5226515101 has 8 divisors (see below), whose sum is σ = 5522791680. Its totient is φ = 4935991632.
The previous prime is 5226515093. The next prime is 5226515113. The reversal of 5226515101 is 1015156225.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5226515101 - 23 = 5226515093 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5226515101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5226512101) 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 7 ways as a sum of consecutive naturals, for example, 1436410 + ... + 1440043.
It is an arithmetic number, because the mean of its divisors is an integer number (690348960).
Almost surely, 25226515101 is an apocalyptic number.
It is an amenable number.
5226515101 is a deficient number, since it is larger than the sum of its proper divisors (296276579).
5226515101 is a wasteful number, since it uses less digits than its factorization.
5226515101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2876555.
The product of its (nonzero) digits is 3000, while the sum is 28.
The square root of 5226515101 is about 72294.6408871363. The cubic root of 5226515101 is about 1735.4178886930.
The spelling of 5226515101 in words is "five billion, two hundred twenty-six million, five hundred fifteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •