Base | Representation |
---|---|
bin | 1101010101101… |
… | …1111001000000 |
3 | 10220021121020000 |
4 | 3111123321000 |
5 | 103310412122 |
6 | 5315120000 |
7 | 1246401123 |
oct | 325337100 |
9 | 126247200 |
10 | 55950912 |
11 | 29645826 |
12 | 168a3000 |
13 | b78cc64 |
14 | 76063ba |
15 | 4da30ac |
hex | 355be40 |
55950912 has 140 divisors (see below), whose sum is σ = 170389296. Its totient is φ = 18144000.
The previous prime is 55950907. The next prime is 55950913. The reversal of 55950912 is 21905955.
55950912 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 (36).
It is not an unprimeable number, because it can be changed into a prime (55950913) 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 19 ways as a sum of consecutive naturals, for example, 222787 + ... + 223037.
Almost surely, 255950912 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 55950912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85194648).
55950912 is an abundant number, since it is smaller than the sum of its proper divisors (114438384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55950912 is a wasteful number, since it uses less digits than its factorization.
55950912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318 (or 299 counting only the distinct ones).
The product of its (nonzero) digits is 20250, while the sum is 36.
The square root of 55950912 is about 7480.0342245206. The cubic root of 55950912 is about 382.4744158205.
The spelling of 55950912 in words is "fifty-five million, nine hundred fifty thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •