Base | Representation |
---|---|
bin | 1101010001110… |
… | …0011100101100 |
3 | 10212210101202120 |
4 | 3110130130230 |
5 | 103224103202 |
6 | 5305352540 |
7 | 1244236404 |
oct | 324343454 |
9 | 125711676 |
10 | 55691052 |
11 | 2948856a |
12 | 16798750 |
13 | b6cb8b1 |
14 | 7579804 |
15 | 4d510bc |
hex | 351c72c |
55691052 has 48 divisors (see below), whose sum is σ = 139722240. Its totient is φ = 17209152.
The previous prime is 55691047. The next prime is 55691059. The reversal of 55691052 is 25019655.
55691052 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 (55691059) 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 15 ways as a sum of consecutive naturals, for example, 8118 + ... + 13314.
It is an arithmetic number, because the mean of its divisors is an integer number (2910880).
Almost surely, 255691052 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 55691052, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69861120).
55691052 is an abundant number, since it is smaller than the sum of its proper divisors (84031188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55691052 is a wasteful number, since it uses less digits than its factorization.
55691052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5270 (or 5268 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 33.
The square root of 55691052 is about 7462.6437674594. The cubic root of 55691052 is about 381.8813717515.
The spelling of 55691052 in words is "fifty-five million, six hundred ninety-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •