Base | Representation |
---|---|
bin | 101000000101110110000… |
… | …1011011111110000010101 |
3 | 201111202120002000222010210 |
4 | 1100023230023133300111 |
5 | 1210234201242310401 |
6 | 15415150531040033 |
7 | 1106043450361401 |
oct | 120135413376025 |
9 | 21452502028123 |
10 | 5510110510101 |
11 | 183490880992a |
12 | 74ba90a40019 |
13 | 30c7a7a82aa2 |
14 | 150995698101 |
15 | 984e5c914d6 |
hex | 502ec2dfc15 |
5510110510101 has 16 divisors (see below), whose sum is σ = 7791795039744. Its totient is φ = 3451628465664.
The previous prime is 5510110510081. The next prime is 5510110510109. The reversal of 5510110510101 is 1010150110155.
It is not a de Polignac number, because 5510110510101 - 27 = 5510110509973 is a prime.
It is a super-2 number, since 2×55101105101012 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5510110510109) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 88965240 + ... + 89027153.
It is an arithmetic number, because the mean of its divisors is an integer number (486987189984).
Almost surely, 25510110510101 is an apocalyptic number.
5510110510101 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
5510110510101 is a deficient number, since it is larger than the sum of its proper divisors (2281684529643).
5510110510101 is a wasteful number, since it uses less digits than its factorization.
5510110510101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177993020.
The product of its (nonzero) digits is 125, while the sum is 21.
Adding to 5510110510101 its reverse (1010150110155), we get a palindrome (6520260620256).
The spelling of 5510110510101 in words is "five trillion, five hundred ten billion, one hundred ten million, five hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •