Base | Representation |
---|---|
bin | 111101111100101000… |
… | …1110000110100000101 |
3 | 110201101011200021010112 |
4 | 1323321101300310011 |
5 | 4134421441431203 |
6 | 141040320202405 |
7 | 12416431363061 |
oct | 1737121606405 |
9 | 421334607115 |
10 | 133031202053 |
11 | 514667110a2 |
12 | 21947a69405 |
13 | c710b92209 |
14 | 661dcb4aa1 |
15 | 36d901c6d8 |
hex | 1ef9470d05 |
133031202053 has 2 divisors, whose sum is σ = 133031202054. Its totient is φ = 133031202052.
The previous prime is 133031202011. The next prime is 133031202071. The reversal of 133031202053 is 350202130331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108594634369 + 24436567684 = 329537^2 + 156322^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133031202053 is a prime.
It is a super-2 number, since 2×1330312020532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133031202653) 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, 66515601026 + 66515601027.
It is an arithmetic number, because the mean of its divisors is an integer number (66515601027).
Almost surely, 2133031202053 is an apocalyptic number.
It is an amenable number.
133031202053 is a deficient number, since it is larger than the sum of its proper divisors (1).
133031202053 is an equidigital number, since it uses as much as digits as its factorization.
133031202053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620, while the sum is 23.
Adding to 133031202053 its reverse (350202130331), we get a palindrome (483233332384).
The spelling of 133031202053 in words is "one hundred thirty-three billion, thirty-one million, two hundred two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •