Base | Representation |
---|---|
bin | 1101100010000… |
… | …0001110100110 |
3 | 10221210110101010 |
4 | 3120200032212 |
5 | 104012130420 |
6 | 5344243050 |
7 | 1256260536 |
oct | 330401646 |
9 | 127713333 |
10 | 56755110 |
11 | 2a044a55 |
12 | 17010486 |
13 | b9b2009 |
14 | 77754c6 |
15 | 4eb14e0 |
hex | 36203a6 |
56755110 has 32 divisors (see below), whose sum is σ = 140608512. Its totient is φ = 14646240.
The previous prime is 56755087. The next prime is 56755123. The reversal of 56755110 is 1155765.
It is a super-2 number, since 2×567551102 = 6442285022224200, which contains 22 as substring.
It is a Smith number, since the sum of its digits (30) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
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, 29584 + ... + 31443.
It is an arithmetic number, because the mean of its divisors is an integer number (4394016).
Almost surely, 256755110 is an apocalyptic number.
56755110 is an abundant number, since it is smaller than the sum of its proper divisors (83853402).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56755110 is a wasteful number, since it uses less digits than its factorization.
56755110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61068.
The product of its (nonzero) digits is 5250, while the sum is 30.
The square root of 56755110 is about 7533.5987416374. The cubic root of 56755110 is about 384.2981760669.
It can be divided in two parts, 56755 and 110, that added together give a palindrome (56865).
The spelling of 56755110 in words is "fifty-six million, seven hundred fifty-five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •