Base | Representation |
---|---|
bin | 11110001111110101110111… |
… | …111000000011100000010011 |
3 | 122110000112202202010100020002 |
4 | 132033311313320003200103 |
5 | 114414031002002222011 |
6 | 1150533053102040215 |
7 | 40010050144255334 |
oct | 3617656770034023 |
9 | 573015682110202 |
10 | 133030033242131 |
11 | 394297a1752273 |
12 | 12b06140b7906b |
13 | 592c8a8318a7c |
14 | 24bc98bab428b |
15 | 105a63a7d0c3b |
hex | 78fd77e03813 |
133030033242131 has 2 divisors, whose sum is σ = 133030033242132. Its totient is φ = 133030033242130.
The previous prime is 133030033242121. The next prime is 133030033242143. The reversal of 133030033242131 is 131242330030331.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133030033242131 is a prime.
It is a super-2 number, since 2×1330300332421312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133030033242094 and 133030033242103.
It is not a weakly prime, because it can be changed into another prime (133030033242121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66515016621065 + 66515016621066.
It is an arithmetic number, because the mean of its divisors is an integer number (66515016621066).
Almost surely, 2133030033242131 is an apocalyptic number.
133030033242131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133030033242131 is an equidigital number, since it uses as much as digits as its factorization.
133030033242131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11664, while the sum is 29.
Adding to 133030033242131 its reverse (131242330030331), we get a palindrome (264272363272462).
The spelling of 133030033242131 in words is "one hundred thirty-three trillion, thirty billion, thirty-three million, two hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •