Base | Representation |
---|---|
bin | 1101010110111… |
… | …1111101110101 |
3 | 10220102210000112 |
4 | 3111233331311 |
5 | 103321030031 |
6 | 5320552405 |
7 | 1250162633 |
oct | 325577565 |
9 | 126383015 |
10 | 56033141 |
11 | 296a158a |
12 | 16922705 |
13 | b7bb508 |
14 | 7628353 |
15 | 4dbc62b |
hex | 356ff75 |
56033141 has 2 divisors, whose sum is σ = 56033142. Its totient is φ = 56033140.
The previous prime is 56033123. The next prime is 56033149. The reversal of 56033141 is 14133065.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 55726225 + 306916 = 7465^2 + 554^2 .
It is a cyclic number.
It is not a de Polignac number, because 56033141 - 26 = 56033077 is a prime.
It is equal to p3340175 and since 56033141 and 3340175 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 (56033149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28016570 + 28016571.
It is an arithmetic number, because the mean of its divisors is an integer number (28016571).
Almost surely, 256033141 is an apocalyptic number.
It is an amenable number.
56033141 is a deficient number, since it is larger than the sum of its proper divisors (1).
56033141 is an equidigital number, since it uses as much as digits as its factorization.
56033141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 23.
The square root of 56033141 is about 7485.5287722378. The cubic root of 56033141 is about 382.6616936382.
The spelling of 56033141 in words is "fifty-six million, thirty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •