Base | Representation |
---|---|
bin | 101000000110010000101… |
… | …0000110110010001011101 |
3 | 201111211212010211220100121 |
4 | 1100030201100312101131 |
5 | 1210243012240334001 |
6 | 15415415143354541 |
7 | 1106104513330423 |
oct | 120144120662135 |
9 | 21454763756317 |
10 | 5511001105501 |
11 | 18352254a8391 |
12 | 75009b152a51 |
13 | 30c8ba435908 |
14 | 150a3ba87113 |
15 | 985490616a1 |
hex | 5032143645d |
5511001105501 has 16 divisors (see below), whose sum is σ = 5665152240000. Its totient is φ = 5358064158720.
The previous prime is 5511001105483. The next prime is 5511001105531. The reversal of 5511001105501 is 1055011001155.
It is a cyclic number.
It is not a de Polignac number, because 5511001105501 - 231 = 5508853621853 is a prime.
It is a super-2 number, since 2×55110011055012 (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 (5511001105531) 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 15 ways as a sum of consecutive naturals, for example, 13929861 + ... + 14320021.
It is an arithmetic number, because the mean of its divisors is an integer number (354072015000).
Almost surely, 25511001105501 is an apocalyptic number.
It is an amenable number.
5511001105501 is a deficient number, since it is larger than the sum of its proper divisors (154151134499).
5511001105501 is a wasteful number, since it uses less digits than its factorization.
5511001105501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 391716.
The product of its (nonzero) digits is 625, while the sum is 25.
Adding to 5511001105501 its reverse (1055011001155), we get a palindrome (6566012106656).
The spelling of 5511001105501 in words is "five trillion, five hundred eleven billion, one million, one hundred five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •