Base | Representation |
---|---|
bin | 1101010101010… |
… | …0100000111101 |
3 | 10220020001210002 |
4 | 3111110200331 |
5 | 103303430301 |
6 | 5314324045 |
7 | 1246214054 |
oct | 325244075 |
9 | 126201702 |
10 | 55920701 |
11 | 29625061 |
12 | 16889625 |
13 | b77c295 |
14 | 75d939b |
15 | 4d9916b |
hex | 355483d |
55920701 has 8 divisors (see below), whose sum is σ = 60022584. Its totient is φ = 51909120.
The previous prime is 55920691. The next prime is 55920707. The reversal of 55920701 is 10702955.
55920701 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 29920900 + 25999801 = 5470^2 + 5099^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 55920701 - 218 = 55658557 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55920707) 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 7 ways as a sum of consecutive naturals, for example, 21290 + ... + 23771.
It is an arithmetic number, because the mean of its divisors is an integer number (7502823).
Almost surely, 255920701 is an apocalyptic number.
It is an amenable number.
55920701 is a deficient number, since it is larger than the sum of its proper divisors (4101883).
55920701 is a wasteful number, since it uses less digits than its factorization.
55920701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45151.
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 55920701 is about 7478.0145092130. The cubic root of 55920701 is about 382.4055637113.
The spelling of 55920701 in words is "fifty-five million, nine hundred twenty thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •