Base | Representation |
---|---|
bin | 1101001010100… |
… | …0101001111001 |
3 | 10211220022011020 |
4 | 3102220221321 |
5 | 103113414021 |
6 | 5251253053 |
7 | 1240222545 |
oct | 322505171 |
9 | 124808136 |
10 | 55216761 |
11 | 29194196 |
12 | 165aa189 |
13 | b593a52 |
14 | 7494a25 |
15 | 4caa7c6 |
hex | 34a8a79 |
55216761 has 4 divisors (see below), whose sum is σ = 73622352. Its totient is φ = 36811172.
The previous prime is 55216753. The next prime is 55216789. The reversal of 55216761 is 16761255.
55216761 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 a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 55216761 - 23 = 55216753 is a prime.
It is a super-2 number, since 2×552167612 = 6097781390662242, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (55216741) 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, 9202791 + ... + 9202796.
It is an arithmetic number, because the mean of its divisors is an integer number (18405588).
Almost surely, 255216761 is an apocalyptic number.
It is an amenable number.
55216761 is a deficient number, since it is larger than the sum of its proper divisors (18405591).
55216761 is a wasteful number, since it uses less digits than its factorization.
55216761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18405590.
The product of its digits is 12600, while the sum is 33.
The square root of 55216761 is about 7430.7981401731. The cubic root of 55216761 is about 380.7941862071.
The spelling of 55216761 in words is "fifty-five million, two hundred sixteen thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •