Base | Representation |
---|---|
bin | 1101001011111… |
… | …0100100000101 |
3 | 10212001212020221 |
4 | 3102332210011 |
5 | 103124302001 |
6 | 5253224341 |
7 | 1241045305 |
oct | 322764405 |
9 | 125055227 |
10 | 55306501 |
11 | 29245658 |
12 | 166320b1 |
13 | b5c5853 |
14 | 74b9605 |
15 | 4cc71a1 |
hex | 34be905 |
55306501 has 2 divisors, whose sum is σ = 55306502. Its totient is φ = 55306500.
The previous prime is 55306487. The next prime is 55306523. The reversal of 55306501 is 10560355.
55306501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 47472100 + 7834401 = 6890^2 + 2799^2 .
It is a cyclic number.
It is not a de Polignac number, because 55306501 - 29 = 55305989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55306561) 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 as a sum of consecutive naturals, namely, 27653250 + 27653251.
It is an arithmetic number, because the mean of its divisors is an integer number (27653251).
Almost surely, 255306501 is an apocalyptic number.
It is an amenable number.
55306501 is a deficient number, since it is larger than the sum of its proper divisors (1).
55306501 is an equidigital number, since it uses as much as digits as its factorization.
55306501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2250, while the sum is 25.
The square root of 55306501 is about 7436.8340710278. The cubic root of 55306501 is about 381.0003674078. Note that the first 3 decimals are identical.
Adding to 55306501 its reverse (10560355), we get a palindrome (65866856).
The spelling of 55306501 in words is "fifty-five million, three hundred six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •