Base | Representation |
---|---|
bin | 11110010001000011001111… |
… | …001110000101000010111111 |
3 | 122110022111012000112212212112 |
4 | 132101003033032011002333 |
5 | 114421411113332341111 |
6 | 1151035152035324235 |
7 | 40016050532540402 |
oct | 3621031716050277 |
9 | 573274160485775 |
10 | 133113103012031 |
11 | 39460a4a44296a |
12 | 12b1a264a5067b |
13 | 5937686422c7c |
14 | 24c29cc417d39 |
15 | 105c89d525e8b |
hex | 7910cf3850bf |
133113103012031 has 2 divisors, whose sum is σ = 133113103012032. Its totient is φ = 133113103012030.
The previous prime is 133113103011991. The next prime is 133113103012037. The reversal of 133113103012031 is 130210301311331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133113103012031 - 214 = 133113102995647 is a prime.
It is a super-2 number, since 2×1331131030120312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133113103011988 and 133113103012006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (133113103012037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66556551506015 + 66556551506016.
It is an arithmetic number, because the mean of its divisors is an integer number (66556551506016).
Almost surely, 2133113103012031 is an apocalyptic number.
133113103012031 is a deficient number, since it is larger than the sum of its proper divisors (1).
133113103012031 is an equidigital number, since it uses as much as digits as its factorization.
133113103012031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 486, while the sum is 23.
Adding to 133113103012031 its reverse (130210301311331), we get a palindrome (263323404323362).
The spelling of 133113103012031 in words is "one hundred thirty-three trillion, one hundred thirteen billion, one hundred three million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •