Base | Representation |
---|---|
bin | 11110001111100100001010… |
… | …100110101110000011100001 |
3 | 122102221201200200120021001211 |
4 | 132033210022212232003201 |
5 | 114413223032122041342 |
6 | 1150520230304430121 |
7 | 40005505034315341 |
oct | 3617441246560341 |
9 | 572851620507054 |
10 | 133011020112097 |
11 | 39421725299266 |
12 | 12b02515618341 |
13 | 592ab68231b7a |
14 | 24bbaa68bcd21 |
15 | 1059dc6500c17 |
hex | 78f90a9ae0e1 |
133011020112097 has 2 divisors, whose sum is σ = 133011020112098. Its totient is φ = 133011020112096.
The previous prime is 133011020112077. The next prime is 133011020112109. The reversal of 133011020112097 is 790211020110331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93387406928656 + 39623613183441 = 9663716^2 + 6294729^2 .
It is an emirp because it is prime and its reverse (790211020110331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133011020112097 - 235 = 132976660373729 is a prime.
It is not a weakly prime, because it can be changed into another prime (133011020112007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66505510056048 + 66505510056049.
It is an arithmetic number, because the mean of its divisors is an integer number (66505510056049).
Almost surely, 2133011020112097 is an apocalyptic number.
It is an amenable number.
133011020112097 is a deficient number, since it is larger than the sum of its proper divisors (1).
133011020112097 is an equidigital number, since it uses as much as digits as its factorization.
133011020112097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 31.
The spelling of 133011020112097 in words is "one hundred thirty-three trillion, eleven billion, twenty million, one hundred twelve thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •