Base | Representation |
---|---|
bin | 1101010000101… |
… | …1001001110011 |
3 | 10212122210120211 |
4 | 3110023021303 |
5 | 103214321321 |
6 | 5304044551 |
7 | 1243523023 |
oct | 324131163 |
9 | 125583524 |
10 | 55620211 |
11 | 2943a319 |
12 | 16763757 |
13 | b6a558a |
14 | 755ba83 |
15 | 4d3a0e1 |
hex | 350b273 |
55620211 has 4 divisors (see below), whose sum is σ = 55707624. Its totient is φ = 55532800.
The previous prime is 55620203. The next prime is 55620263. The reversal of 55620211 is 11202655.
55620211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11202655 = 5 ⋅2240531.
It is a cyclic number.
It is not a de Polignac number, because 55620211 - 23 = 55620203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (55620281) 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 3 ways as a sum of consecutive naturals, for example, 42745 + ... + 44026.
It is an arithmetic number, because the mean of its divisors is an integer number (13926906).
Almost surely, 255620211 is an apocalyptic number.
55620211 is a deficient number, since it is larger than the sum of its proper divisors (87413).
55620211 is an equidigital number, since it uses as much as digits as its factorization.
55620211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87412.
The product of its (nonzero) digits is 600, while the sum is 22.
The square root of 55620211 is about 7457.8958828881. The cubic root of 55620211 is about 381.7193808144.
Adding to 55620211 its reverse (11202655), we get a palindrome (66822866).
The spelling of 55620211 in words is "fifty-five million, six hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •