Base | Representation |
---|---|
bin | 1101001010101… |
… | …1000100111010 |
3 | 10211220210202200 |
4 | 3102223010322 |
5 | 103114223212 |
6 | 5251411030 |
7 | 1240263510 |
oct | 322530472 |
9 | 124823680 |
10 | 55226682 |
11 | 291a0695 |
12 | 165b3a76 |
13 | b598414 |
14 | 74984b0 |
15 | 4cad6dc |
hex | 34ab13a |
55226682 has 48 divisors (see below), whose sum is σ = 137641920. Its totient is φ = 15676416.
The previous prime is 55226669. The next prime is 55226707. The reversal of 55226682 is 28662255.
55226682 is a `hidden beast` number, since 552 + 26 + 6 + 82 = 666.
55226682 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 (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19194 + ... + 21882.
It is an arithmetic number, because the mean of its divisors is an integer number (2867540).
Almost surely, 255226682 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55226682, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68820960).
55226682 is an abundant number, since it is smaller than the sum of its proper divisors (82415238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55226682 is a wasteful number, since it uses less digits than its factorization.
55226682 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2867 (or 2864 counting only the distinct ones).
The product of its digits is 57600, while the sum is 36.
The square root of 55226682 is about 7431.4656697047. The cubic root of 55226682 is about 380.8169910754.
The spelling of 55226682 in words is "fifty-five million, two hundred twenty-six thousand, six hundred eighty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •