Base | Representation |
---|---|
bin | 11110010011110010001110… |
… | …111011110001101000101011 |
3 | 122110222110012002120221202021 |
4 | 132103302032323301220223 |
5 | 114433000423234030011 |
6 | 1151301345125045311 |
7 | 40035452056424113 |
oct | 3623621673615053 |
9 | 573873162527667 |
10 | 133301003033131 |
11 | 395237020758aa |
12 | 12b4a764256837 |
13 | 594c2cc9735cb |
14 | 24cbb354d4043 |
15 | 10626e957b471 |
hex | 793c8eef1a2b |
133301003033131 has 2 divisors, whose sum is σ = 133301003033132. Its totient is φ = 133301003033130.
The previous prime is 133301003033069. The next prime is 133301003033137. The reversal of 133301003033131 is 131330300103331.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 133301003033131 - 223 = 133300994644523 is a prime.
It is a super-2 number, since 2×1333010030331312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133301003033096 and 133301003033105.
It is not a weakly prime, because it can be changed into another prime (133301003033137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66650501516565 + 66650501516566.
It is an arithmetic number, because the mean of its divisors is an integer number (66650501516566).
Almost surely, 2133301003033131 is an apocalyptic number.
133301003033131 is a deficient number, since it is larger than the sum of its proper divisors (1).
133301003033131 is an equidigital number, since it uses as much as digits as its factorization.
133301003033131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2187, while the sum is 25.
Adding to 133301003033131 its reverse (131330300103331), we get a palindrome (264631303136462).
The spelling of 133301003033131 in words is "one hundred thirty-three trillion, three hundred one billion, three million, thirty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •