Base | Representation |
---|---|
bin | 1111110111100… |
… | …01111100111001 |
3 | 100021110202210121 |
4 | 13323301330321 |
5 | 233034032414 |
6 | 21113013241 |
7 | 3204300331 |
oct | 773617471 |
9 | 307422717 |
10 | 133111609 |
11 | 691577a4 |
12 | 386b4221 |
13 | 21767b87 |
14 | 139700c1 |
15 | ba45724 |
hex | 7ef1f39 |
133111609 has 2 divisors, whose sum is σ = 133111610. Its totient is φ = 133111608.
The previous prime is 133111591. The next prime is 133111633. The reversal of 133111609 is 906111331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 85155984 + 47955625 = 9228^2 + 6925^2 .
It is an emirp because it is prime and its reverse (906111331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133111609 - 27 = 133111481 is a prime.
It is not a weakly prime, because it can be changed into another prime (133111639) 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, 66555804 + 66555805.
It is an arithmetic number, because the mean of its divisors is an integer number (66555805).
Almost surely, 2133111609 is an apocalyptic number.
It is an amenable number.
133111609 is a deficient number, since it is larger than the sum of its proper divisors (1).
133111609 is an equidigital number, since it uses as much as digits as its factorization.
133111609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 25.
The square root of 133111609 is about 11537.4004437742. The cubic root of 133111609 is about 510.5896153994.
The spelling of 133111609 in words is "one hundred thirty-three million, one hundred eleven thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •