Base | Representation |
---|---|
bin | 1101010001101… |
… | …1101100000000 |
3 | 10212210020111011 |
4 | 3110123230000 |
5 | 103224003221 |
6 | 5305330304 |
7 | 1244224333 |
oct | 324335400 |
9 | 125706434 |
10 | 55687936 |
11 | 29486197 |
12 | 16796994 |
13 | b6ca355 |
14 | 757861a |
15 | 4d501e1 |
hex | 351bb00 |
55687936 has 54 divisors (see below), whose sum is σ = 118112540. Its totient is φ = 26131968.
The previous prime is 55687909. The next prime is 55687939. The reversal of 55687936 is 63978655.
It is a super-2 number, since 2×556879362 = 6202292431880192, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 55687936.
It is not an unprimeable number, because it can be changed into a prime (55687939) 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 5 ways as a sum of consecutive naturals, for example, 520395 + ... + 520501.
Almost surely, 255687936 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 55687936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (59056270).
55687936 is an abundant number, since it is smaller than the sum of its proper divisors (62424604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55687936 is an equidigital number, since it uses as much as digits as its factorization.
55687936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 249 (or 128 counting only the distinct ones).
The product of its digits is 1360800, while the sum is 49.
The square root of 55687936 is about 7462.4349913416. The cubic root of 55687936 is about 381.8742493353.
The spelling of 55687936 in words is "fifty-five million, six hundred eighty-seven thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •