Base | Representation |
---|---|
bin | 1101001000011… |
… | …0101110000100 |
3 | 10211122020111012 |
4 | 3102012232010 |
5 | 103044442024 |
6 | 5244301352 |
7 | 1236103400 |
oct | 322065604 |
9 | 124566435 |
10 | 55077764 |
11 | 290a9815 |
12 | 16541858 |
13 | b5456c1 |
14 | 745a100 |
15 | 4c7e50e |
hex | 3486b84 |
55077764 has 36 divisors (see below), whose sum is σ = 113317596. Its totient is φ = 23353344.
The previous prime is 55077733. The next prime is 55077767. The reversal of 55077764 is 46777055.
It can be written as a sum of positive squares in 2 ways, for example, as 14500864 + 40576900 = 3808^2 + 6370^2 .
It is not an unprimeable number, because it can be changed into a prime (55077767) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17564 + ... + 20460.
It is an arithmetic number, because the mean of its divisors is an integer number (3147711).
Almost surely, 255077764 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 55077764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (56658798).
55077764 is an abundant number, since it is smaller than the sum of its proper divisors (58239832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55077764 is a wasteful number, since it uses less digits than its factorization.
55077764 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3012 (or 3003 counting only the distinct ones).
The product of its (nonzero) digits is 205800, while the sum is 41.
The square root of 55077764 is about 7421.4394830114. The cubic root of 55077764 is about 380.4743936680.
The spelling of 55077764 in words is "fifty-five million, seventy-seven thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •