Base | Representation |
---|---|
bin | 11110010111101000011110… |
… | …100111100100110111110011 |
3 | 122111220201122211122222100021 |
4 | 132113220132213210313303 |
5 | 120001313423101142011 |
6 | 1152023033432304311 |
7 | 40063532201250253 |
oct | 3627503647446763 |
9 | 574821584588307 |
10 | 133565406662131 |
11 | 39615853021774 |
12 | 12b91a54542097 |
13 | 596b218b536a2 |
14 | 24da858c49963 |
15 | 1069521b57471 |
hex | 797a1e9e4df3 |
133565406662131 has 2 divisors, whose sum is σ = 133565406662132. Its totient is φ = 133565406662130.
The previous prime is 133565406662071. The next prime is 133565406662143. The reversal of 133565406662131 is 131266604565331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133565406662131 - 229 = 133564869791219 is a prime.
It is a super-2 number, since 2×1335654066621312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133565406660131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66782703331065 + 66782703331066.
It is an arithmetic number, because the mean of its divisors is an integer number (66782703331066).
Almost surely, 2133565406662131 is an apocalyptic number.
133565406662131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133565406662131 is an equidigital number, since it uses as much as digits as its factorization.
133565406662131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6998400, while the sum is 52.
The spelling of 133565406662131 in words is "one hundred thirty-three trillion, five hundred sixty-five billion, four hundred six million, six hundred sixty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •