Base | Representation |
---|---|
bin | 1101001010011… |
… | …0011010011100 |
3 | 10211212211120012 |
4 | 3102212122130 |
5 | 103113120310 |
6 | 5251142352 |
7 | 1240154021 |
oct | 322463234 |
9 | 124784505 |
10 | 55207580 |
11 | 291882aa |
12 | 165a49b8 |
13 | b58c80c |
14 | 7491548 |
15 | 4ca7c05 |
hex | 34a669c |
55207580 has 12 divisors (see below), whose sum is σ = 115935960. Its totient is φ = 22083024.
The previous prime is 55207577. The next prime is 55207583. The reversal of 55207580 is 8570255.
It is a happy number.
55207580 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (55207577) and next prime (55207583).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55207583) 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 3 ways as a sum of consecutive naturals, for example, 1380170 + ... + 1380209.
It is an arithmetic number, because the mean of its divisors is an integer number (9661330).
Almost surely, 255207580 is an apocalyptic number.
It is an amenable number.
55207580 is an abundant number, since it is smaller than the sum of its proper divisors (60728380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55207580 is a wasteful number, since it uses less digits than its factorization.
55207580 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2760388 (or 2760386 counting only the distinct ones).
The product of its (nonzero) digits is 14000, while the sum is 32.
The square root of 55207580 is about 7430.1803477439. The cubic root of 55207580 is about 380.7730799032.
The spelling of 55207580 in words is "fifty-five million, two hundred seven thousand, five hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •