Base | Representation |
---|---|
bin | 1111111010111… |
… | …11001101101011 |
3 | 100022022111201002 |
4 | 13331133031223 |
5 | 233142343042 |
6 | 21130345215 |
7 | 3211143161 |
oct | 775371553 |
9 | 308274632 |
10 | 133559147 |
11 | 69432a67 |
12 | 3888b20b |
13 | 218937a7 |
14 | 13a49231 |
15 | bad3132 |
hex | 7f5f36b |
133559147 has 2 divisors, whose sum is σ = 133559148. Its totient is φ = 133559146.
The previous prime is 133559143. The next prime is 133559149. The reversal of 133559147 is 741955331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133559147 - 22 = 133559143 is a prime.
Together with 133559149, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 133559147.
It is not a weakly prime, because it can be changed into another prime (133559141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66779573 + 66779574.
It is an arithmetic number, because the mean of its divisors is an integer number (66779574).
Almost surely, 2133559147 is an apocalyptic number.
133559147 is a deficient number, since it is larger than the sum of its proper divisors (1).
133559147 is an equidigital number, since it uses as much as digits as its factorization.
133559147 is an evil number, because the sum of its binary digits is even.
The product of its digits is 56700, while the sum is 38.
The square root of 133559147 is about 11556.7792658682. The cubic root of 133559147 is about 511.1611975053.
The spelling of 133559147 in words is "one hundred thirty-three million, five hundred fifty-nine thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •