Base | Representation |
---|---|
bin | 1111110111001… |
… | …11101011100001 |
3 | 100021101122002101 |
4 | 13323213223201 |
5 | 233031211122 |
6 | 21112050401 |
7 | 3204033556 |
oct | 773475341 |
9 | 307348071 |
10 | 133069537 |
11 | 69129127 |
12 | 38693a01 |
13 | 21751993 |
14 | 1395ca2d |
15 | ba38027 |
hex | 7ee7ae1 |
133069537 has 2 divisors, whose sum is σ = 133069538. Its totient is φ = 133069536.
The previous prime is 133069499. The next prime is 133069561. The reversal of 133069537 is 735960331.
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., 116618401 + 16451136 = 10799^2 + 4056^2 .
It is an emirp because it is prime and its reverse (735960331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133069537 - 223 = 124680929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 133069496 and 133069505.
It is not a weakly prime, because it can be changed into another prime (133069337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66534768 + 66534769.
It is an arithmetic number, because the mean of its divisors is an integer number (66534769).
Almost surely, 2133069537 is an apocalyptic number.
It is an amenable number.
133069537 is a deficient number, since it is larger than the sum of its proper divisors (1).
133069537 is an equidigital number, since it uses as much as digits as its factorization.
133069537 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 51030, while the sum is 37.
The square root of 133069537 is about 11535.5770120094. The cubic root of 133069537 is about 510.5358164607.
The spelling of 133069537 in words is "one hundred thirty-three million, sixty-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •