Base | Representation |
---|---|
bin | 1101001010101… |
… | …0111011000100 |
3 | 10211220202220100 |
4 | 3102222323010 |
5 | 103114213202 |
6 | 5251404100 |
7 | 1240261620 |
oct | 322527304 |
9 | 124822810 |
10 | 55226052 |
11 | 291a0172 |
12 | 165b3630 |
13 | b59804b |
14 | 7498180 |
15 | 4cad41c |
hex | 34aaec4 |
55226052 has 72 divisors (see below), whose sum is σ = 163881536. Its totient is φ = 15349824.
The previous prime is 55226051. The next prime is 55226069. The reversal of 55226052 is 25062255.
55226052 is a `hidden beast` number, since 5 + 52 + 2 + 605 + 2 = 666.
55226052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (55226051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 6363 + ... + 12285.
Almost surely, 255226052 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55226052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81940768).
55226052 is an abundant number, since it is smaller than the sum of its proper divisors (108655484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55226052 is a wasteful number, since it uses less digits than its factorization.
55226052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5977 (or 5972 counting only the distinct ones).
The product of its (nonzero) digits is 6000, while the sum is 27.
The square root of 55226052 is about 7431.4232822522. The cubic root of 55226052 is about 380.8155430095.
The spelling of 55226052 in words is "fifty-five million, two hundred twenty-six thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •