Base | Representation |
---|---|
bin | 1101010010010… |
… | …1101101000000 |
3 | 10212212022202120 |
4 | 3110211231000 |
5 | 103231311320 |
6 | 5310244240 |
7 | 1244455050 |
oct | 324455500 |
9 | 125768676 |
10 | 55728960 |
11 | 29503aa1 |
12 | 167b6680 |
13 | b712c21 |
14 | 7589560 |
15 | 4d5c440 |
hex | 3525b40 |
55728960 has 112 divisors (see below), whose sum is σ = 202240896. Its totient is φ = 12736512.
The previous prime is 55728947. The next prime is 55728961. The reversal of 55728960 is 6982755.
It is a tau number, because it is divible by the number of its divisors (112).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (55728961) 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 15 ways as a sum of consecutive naturals, for example, 2574 + ... + 10866.
Almost surely, 255728960 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 55728960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101120448).
55728960 is an abundant number, since it is smaller than the sum of its proper divisors (146511936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55728960 is a wasteful number, since it uses less digits than its factorization.
55728960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8320 (or 8310 counting only the distinct ones).
The product of its (nonzero) digits is 151200, while the sum is 42.
The square root of 55728960 is about 7465.1831859640. The cubic root of 55728960 is about 381.9679989274.
The spelling of 55728960 in words is "fifty-five million, seven hundred twenty-eight thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •