Base | Representation |
---|---|
bin | 110011101111000110… |
… | …101010101101111101 |
3 | 12022101110012210000000 |
4 | 303233012222231331 |
5 | 1402232041010023 |
6 | 41304141024513 |
7 | 4004415433650 |
oct | 635706525575 |
9 | 168343183000 |
10 | 55551110013 |
11 | 21617176183 |
12 | a923b55139 |
13 | 5313b3a0c9 |
14 | 298da8d897 |
15 | 16a1dad243 |
hex | cef1aab7d |
55551110013 has 32 divisors (see below), whose sum is σ = 95215985920. Its totient is φ = 31743482688.
The previous prime is 55551110011. The next prime is 55551110039. The reversal of 55551110013 is 31001115555.
55551110013 is a `hidden beast` number, since 5 + 5 + 551 + 1 + 100 + 1 + 3 = 666.
It is not a de Polignac number, because 55551110013 - 21 = 55551110011 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55551110011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1799020 + ... + 1829637.
It is an arithmetic number, because the mean of its divisors is an integer number (2975499560).
Almost surely, 255551110013 is an apocalyptic number.
It is an amenable number.
55551110013 is a deficient number, since it is larger than the sum of its proper divisors (39664875907).
55551110013 is an frugal number, since it uses more digits than its factorization.
55551110013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3628685 (or 3628667 counting only the distinct ones).
The product of its (nonzero) digits is 1875, while the sum is 27.
Adding to 55551110013 its reverse (31001115555), we get a palindrome (86552225568).
The spelling of 55551110013 in words is "fifty-five billion, five hundred fifty-one million, one hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •