Base | Representation |
---|---|
bin | 11001001100011011001111… |
… | …11001000000110101110100 |
3 | 21021011102121022020110220010 |
4 | 30212031213321000311310 |
5 | 24230203333143300004 |
6 | 313455322534140220 |
7 | 14445462150125145 |
oct | 1446154771006564 |
9 | 237142538213803 |
10 | 55402526150004 |
11 | 16720096741920 |
12 | 6269469ab1670 |
13 | 24bb5885ac497 |
14 | d976d484dacc |
15 | 66123091da89 |
hex | 326367e40d74 |
55402526150004 has 48 divisors (see below), whose sum is σ = 141025916074176. Its totient is φ = 16788489043200.
The previous prime is 55402526149933. The next prime is 55402526150017. The reversal of 55402526150004 is 40005162520455.
55402526150004 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent 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, 12811594 + ... + 16581374.
It is an arithmetic number, because the mean of its divisors is an integer number (2938039918212).
Almost surely, 255402526150004 is an apocalyptic number.
It is an amenable number.
55402526150004 is an abundant number, since it is smaller than the sum of its proper divisors (85623389924172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55402526150004 is a wasteful number, since it uses less digits than its factorization.
55402526150004 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3881136 (or 3881134 counting only the distinct ones).
The product of its (nonzero) digits is 240000, while the sum is 39.
Adding to 55402526150004 its reverse (40005162520455), we get a palindrome (95407688670459).
The spelling of 55402526150004 in words is "fifty-five trillion, four hundred two billion, five hundred twenty-six million, one hundred fifty thousand, four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •