Base | Representation |
---|---|
bin | 11110011101110100100100… |
… | …011100001110010000101101 |
3 | 122120102101102200121112111121 |
4 | 132131310210130032100231 |
5 | 120030300431231032113 |
6 | 1152550251451420541 |
7 | 40136336415030055 |
oct | 3635644434162055 |
9 | 576371380545447 |
10 | 133990706111533 |
11 | 3976a159518937 |
12 | 13040368454751 |
13 | 599c366a6251b |
14 | 2513283064565 |
15 | 1075614673e8d |
hex | 79dd2470e42d |
133990706111533 has 2 divisors, whose sum is σ = 133990706111534. Its totient is φ = 133990706111532.
The previous prime is 133990706111459. The next prime is 133990706111543. The reversal of 133990706111533 is 335111607099331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87738778142404 + 46251927969129 = 9366898^2 + 6800877^2 .
It is a cyclic number.
It is not a de Polignac number, because 133990706111533 - 233 = 133982116176941 is a prime.
It is a super-2 number, since 2×1339907061115332 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133990706111543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66995353055766 + 66995353055767.
It is an arithmetic number, because the mean of its divisors is an integer number (66995353055767).
Almost surely, 2133990706111533 is an apocalyptic number.
It is an amenable number.
133990706111533 is a deficient number, since it is larger than the sum of its proper divisors (1).
133990706111533 is an equidigital number, since it uses as much as digits as its factorization.
133990706111533 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1377810, while the sum is 52.
The spelling of 133990706111533 in words is "one hundred thirty-three trillion, nine hundred ninety billion, seven hundred six million, one hundred eleven thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •