Base | Representation |
---|---|
bin | 11001000100001111101011… |
… | …11110010111000001010010 |
3 | 21020011120002001221222122210 |
4 | 30202013311332113001102 |
5 | 24211102203132342311 |
6 | 313122235123012550 |
7 | 14416251501660150 |
oct | 1442076576270122 |
9 | 236146061858583 |
10 | 55121442074706 |
11 | 16621966046847 |
12 | 6222aa350a156 |
13 | 249ac11692037 |
14 | d87c6ba3c3d0 |
15 | 658c7dc3d3a6 |
hex | 3221f5f97052 |
55121442074706 has 32 divisors (see below), whose sum is σ = 128057308057728. Its totient is φ = 15490803392640.
The previous prime is 55121442074641. The next prime is 55121442074719. The reversal of 55121442074706 is 60747024412155.
55121442074706 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (48) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is an unprimeable number.
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, 10757499795 + ... + 10757504918.
It is an arithmetic number, because the mean of its divisors is an integer number (4001790876804).
Almost surely, 255121442074706 is an apocalyptic number.
55121442074706 is an abundant number, since it is smaller than the sum of its proper divisors (72935865983022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55121442074706 is a wasteful number, since it uses less digits than its factorization.
55121442074706 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21515004786.
The product of its (nonzero) digits is 1881600, while the sum is 48.
The spelling of 55121442074706 in words is "fifty-five trillion, one hundred twenty-one billion, four hundred forty-two million, seventy-four thousand, seven hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.229 sec. • engine limits •