Base | Representation |
---|---|
bin | 1010010001000000… |
… | …11010110001001101 |
3 | 112020002201101220121 |
4 | 11020200122301031 |
5 | 42241411100401 |
6 | 2310520544541 |
7 | 253402224520 |
oct | 51040326115 |
9 | 15202641817 |
10 | 5511425101 |
11 | 2379068286 |
12 | 1099922151 |
13 | 69aab40b0 |
14 | 3a3d8cbb7 |
15 | 223cc9ca1 |
hex | 14881ac4d |
5511425101 has 16 divisors (see below), whose sum is σ = 6802768000. Its totient is φ = 4348168128.
The previous prime is 5511425053. The next prime is 5511425113. The reversal of 5511425101 is 1015241155.
5511425101 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5511425101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5511425141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55011 + ... + 118528.
It is an arithmetic number, because the mean of its divisors is an integer number (425173000).
Almost surely, 25511425101 is an apocalyptic number.
It is an amenable number.
5511425101 is a deficient number, since it is larger than the sum of its proper divisors (1291342899).
5511425101 is a wasteful number, since it uses less digits than its factorization.
5511425101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 173908.
The product of its (nonzero) digits is 1000, while the sum is 25.
The square root of 5511425101 is about 74238.9729252769. The cubic root of 5511425101 is about 1766.3955824991.
Adding to 5511425101 its reverse (1015241155), we get a palindrome (6526666256).
The spelling of 5511425101 in words is "five billion, five hundred eleven million, four hundred twenty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •