Base | Representation |
---|---|
bin | 1101001001101… |
… | …0001111000101 |
3 | 10211210022010211 |
4 | 3102122033011 |
5 | 103110021301 |
6 | 5250115421 |
7 | 1236555424 |
oct | 322321705 |
9 | 124708124 |
10 | 55157701 |
11 | 29153885 |
12 | 1657bb71 |
13 | b572bc1 |
14 | 747b2bb |
15 | 4c98051 |
hex | 349a3c5 |
55157701 has 2 divisors, whose sum is σ = 55157702. Its totient is φ = 55157700.
The previous prime is 55157689. The next prime is 55157719. The reversal of 55157701 is 10775155.
55157701 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., 40335201 + 14822500 = 6351^2 + 3850^2 .
It is a cyclic number.
It is not a de Polignac number, because 55157701 - 27 = 55157573 is a prime.
It is equal to p3291097 and since 55157701 and 3291097 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (55157731) 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, 27578850 + 27578851.
It is an arithmetic number, because the mean of its divisors is an integer number (27578851).
Almost surely, 255157701 is an apocalyptic number.
It is an amenable number.
55157701 is a deficient number, since it is larger than the sum of its proper divisors (1).
55157701 is an equidigital number, since it uses as much as digits as its factorization.
55157701 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6125, while the sum is 31.
The square root of 55157701 is about 7426.8230758515. The cubic root of 55157701 is about 380.6583716021.
The spelling of 55157701 in words is "fifty-five million, one hundred fifty-seven thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •