Base | Representation |
---|---|
bin | 1101001001011… |
… | …1010100100110 |
3 | 10211202200202210 |
4 | 3102113110212 |
5 | 103104131031 |
6 | 5245544250 |
7 | 1236505554 |
oct | 322272446 |
9 | 124680683 |
10 | 55145766 |
11 | 29145915 |
12 | 16575086 |
13 | b56a640 |
14 | 7476bd4 |
15 | 4c94746 |
hex | 3497526 |
55145766 has 64 divisors (see below), whose sum is σ = 126282240. Its totient is φ = 15924480.
The previous prime is 55145729. The next prime is 55145801. The reversal of 55145766 is 66754155.
55145766 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (39).
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 31 ways as a sum of consecutive naturals, for example, 105586 + ... + 106106.
It is an arithmetic number, because the mean of its divisors is an integer number (1973160).
Almost surely, 255145766 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 55145766, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (63141120).
55145766 is an abundant number, since it is smaller than the sum of its proper divisors (71136474).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55145766 is a wasteful number, since it uses less digits than its factorization.
55145766 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 621.
The product of its digits is 126000, while the sum is 39.
The square root of 55145766 is about 7426.0195259641. The cubic root of 55145766 is about 380.6309140558.
The spelling of 55145766 in words is "fifty-five million, one hundred forty-five thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •