Base | Representation |
---|---|
bin | 1101010010111… |
… | …1010010011000 |
3 | 10212221022121111 |
4 | 3110233102120 |
5 | 103234040331 |
6 | 5311150104 |
7 | 1245010360 |
oct | 324572230 |
9 | 125838544 |
10 | 55768216 |
11 | 29530539 |
12 | 16815334 |
13 | b727a5a |
14 | 75999a0 |
15 | 4d68db1 |
hex | 352f498 |
55768216 has 32 divisors (see below), whose sum is σ = 121536000. Its totient is φ = 23494176.
The previous prime is 55768199. The next prime is 55768253. The reversal of 55768216 is 61286755.
55768216 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×557682163 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
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, 5136 + ... + 11743.
It is an arithmetic number, because the mean of its divisors is an integer number (3798000).
Almost surely, 255768216 is an apocalyptic number.
55768216 is a gapful number since it is divisible by the number (56) formed by its first and last digit.
It is an amenable number.
55768216 is an abundant number, since it is smaller than the sum of its proper divisors (65767784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55768216 is a wasteful number, since it uses less digits than its factorization.
55768216 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16951 (or 16947 counting only the distinct ones).
The product of its digits is 100800, while the sum is 40.
The square root of 55768216 is about 7467.8119954910. The cubic root of 55768216 is about 382.0576651523.
The spelling of 55768216 in words is "fifty-five million, seven hundred sixty-eight thousand, two hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.130 sec. • engine limits •