Base | Representation |
---|---|
bin | 10010110000000010… |
… | …001110000011000111 |
3 | 1220222010020121120202 |
4 | 102300002032003013 |
5 | 312213102203111 |
6 | 13125445121115 |
7 | 1311630503501 |
oct | 226002160307 |
9 | 56863217522 |
10 | 20133241031 |
11 | 85a1764a82 |
12 | 3a9a6b919b |
13 | 1b8b189697 |
14 | d8dc8ad71 |
15 | 7cc7d9b3b |
hex | 4b008e0c7 |
20133241031 has 2 divisors, whose sum is σ = 20133241032. Its totient is φ = 20133241030.
The previous prime is 20133240989. The next prime is 20133241033. The reversal of 20133241031 is 13014233102.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20133241031 - 222 = 20129046727 is a prime.
It is a super-2 number, since 2×201332410312 (a number of 21 digits) contains 22 as substring.
Together with 20133241033, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 20133240994 and 20133241012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20133241033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10066620515 + 10066620516.
It is an arithmetic number, because the mean of its divisors is an integer number (10066620516).
Almost surely, 220133241031 is an apocalyptic number.
20133241031 is a deficient number, since it is larger than the sum of its proper divisors (1).
20133241031 is an equidigital number, since it uses as much as digits as its factorization.
20133241031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 20133241031 its reverse (13014233102), we get a palindrome (33147474133).
The spelling of 20133241031 in words is "twenty billion, one hundred thirty-three million, two hundred forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •