Base | Representation |
---|---|
bin | 10010101000010010… |
… | …001110101000111111 |
3 | 1220122001120212022011 |
4 | 102220102032220333 |
5 | 311431311020111 |
6 | 13104522232051 |
7 | 1305461364514 |
oct | 225022165077 |
9 | 56561525264 |
10 | 20003220031 |
11 | 8535329303 |
12 | 3a63055627 |
13 | 1b6a264492 |
14 | d7a8c330b |
15 | 7c11a5021 |
hex | 4a848ea3f |
20003220031 has 2 divisors, whose sum is σ = 20003220032. Its totient is φ = 20003220030.
The previous prime is 20003220001. The next prime is 20003220047. The reversal of 20003220031 is 13002230002.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20003220031 - 29 = 20003219519 is a prime.
It is a super-2 number, since 2×200032200312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20003219993 and 20003220020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20003220001) 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, 10001610015 + 10001610016.
It is an arithmetic number, because the mean of its divisors is an integer number (10001610016).
Almost surely, 220003220031 is an apocalyptic number.
20003220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003220031 is an equidigital number, since it uses as much as digits as its factorization.
20003220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 13.
Adding to 20003220031 its reverse (13002230002), we get a palindrome (33005450033).
The spelling of 20003220031 in words is "twenty billion, three million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •