Base | Representation |
---|---|
bin | 11000100110111110010100… |
… | …11001001001000110011101 |
3 | 21002121102001101021021011020 |
4 | 30103133022121021012131 |
5 | 24043112412232111223 |
6 | 311032223142314353 |
7 | 14253505132040031 |
oct | 1423371231110635 |
9 | 232542041237136 |
10 | 54115688550813 |
11 | 1627437543722a |
12 | 609bb967289b9 |
13 | 242711a4081b6 |
14 | d512db4261c1 |
15 | 63ca173291e3 |
hex | 3137ca64919d |
54115688550813 has 16 divisors (see below), whose sum is σ = 74227668169536. Its totient is φ = 35043662102400.
The previous prime is 54115688550709. The next prime is 54115688550863. The reversal of 54115688550813 is 31805588651145.
It is a happy number.
54115688550813 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 54115688550813 - 222 = 54115684356509 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54115688550863) 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 15 ways as a sum of consecutive naturals, for example, 405531231 + ... + 405664652.
It is an arithmetic number, because the mean of its divisors is an integer number (4639229260596).
Almost surely, 254115688550813 is an apocalyptic number.
It is an amenable number.
54115688550813 is a deficient number, since it is larger than the sum of its proper divisors (20111979618723).
54115688550813 is a wasteful number, since it uses less digits than its factorization.
54115688550813 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 811196524.
The product of its (nonzero) digits is 23040000, while the sum is 60.
The spelling of 54115688550813 in words is "fifty-four trillion, one hundred fifteen billion, six hundred eighty-eight million, five hundred fifty thousand, eight hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •