Base | Representation |
---|---|
bin | 1111111000101… |
… | …11101010001101 |
3 | 100021202121200001 |
4 | 13330113222031 |
5 | 233104003221 |
6 | 21120204301 |
7 | 3205512535 |
oct | 774275215 |
9 | 307677601 |
10 | 133266061 |
11 | 69252845 |
12 | 38769691 |
13 | 217c0276 |
14 | 139b04c5 |
15 | ba76391 |
hex | 7f17a8d |
133266061 has 2 divisors, whose sum is σ = 133266062. Its totient is φ = 133266060.
The previous prime is 133266017. The next prime is 133266083. The reversal of 133266061 is 160662331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 130644900 + 2621161 = 11430^2 + 1619^2 .
It is an emirp because it is prime and its reverse (160662331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133266061 - 213 = 133257869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133266461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66633030 + 66633031.
It is an arithmetic number, because the mean of its divisors is an integer number (66633031).
Almost surely, 2133266061 is an apocalyptic number.
It is an amenable number.
133266061 is a deficient number, since it is larger than the sum of its proper divisors (1).
133266061 is an equidigital number, since it uses as much as digits as its factorization.
133266061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 133266061 is about 11544.0920387876. The cubic root of 133266061 is about 510.7870214358.
The spelling of 133266061 in words is "one hundred thirty-three million, two hundred sixty-six thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •