Base | Representation |
---|---|
bin | 10010101010000101… |
… | …000101101111010011 |
3 | 1220201011020121121001 |
4 | 102222011011233103 |
5 | 312012013031011 |
6 | 13111515442431 |
7 | 1306305332203 |
oct | 225205055723 |
9 | 56634217531 |
10 | 20033330131 |
11 | 8550324491 |
12 | 3a71156417 |
13 | 1b735775c9 |
14 | d808c0403 |
15 | 7c3b517c1 |
hex | 4aa145bd3 |
20033330131 has 2 divisors, whose sum is σ = 20033330132. Its totient is φ = 20033330130.
The previous prime is 20033330101. The next prime is 20033330147. The reversal of 20033330131 is 13103333002.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20033330131 - 25 = 20033330099 is a prime.
It is a super-2 number, since 2×200333301312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20033330099 and 20033330108.
It is not a weakly prime, because it can be changed into another prime (20033330101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10016665065 + 10016665066.
It is an arithmetic number, because the mean of its divisors is an integer number (10016665066).
Almost surely, 220033330131 is an apocalyptic number.
20033330131 is a deficient number, since it is larger than the sum of its proper divisors (1).
20033330131 is an equidigital number, since it uses as much as digits as its factorization.
20033330131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 20033330131 its reverse (13103333002), we get a palindrome (33136663133).
The spelling of 20033330131 in words is "twenty billion, thirty-three million, three hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •