Base | Representation |
---|---|
bin | 1011110000101010001… |
… | …0101000000000010111 |
3 | 201022111112111021011021 |
4 | 2330022202220000113 |
5 | 11302234304434311 |
6 | 232452133022011 |
7 | 20411514213001 |
oct | 2741242500027 |
9 | 638445437137 |
10 | 202040311831 |
11 | 78759541726 |
12 | 331a6a84907 |
13 | 1608ac3bc97 |
14 | 9ac9071371 |
15 | 53c764b171 |
hex | 2f0a8a8017 |
202040311831 has 2 divisors, whose sum is σ = 202040311832. Its totient is φ = 202040311830.
The previous prime is 202040311813. The next prime is 202040311849. The reversal of 202040311831 is 138113040202.
It is a happy number.
Together with previous prime (202040311813) it forms an Ormiston pair, because they use the same digits, order apart.
It is a balanced prime because it is at equal distance from previous prime (202040311813) and next prime (202040311849).
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-202040311831 is a prime.
It is a super-2 number, since 2×2020403118312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 202040311796 and 202040311805.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (202040311801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101020155915 + 101020155916.
It is an arithmetic number, because the mean of its divisors is an integer number (101020155916).
Almost surely, 2202040311831 is an apocalyptic number.
202040311831 is a deficient number, since it is larger than the sum of its proper divisors (1).
202040311831 is an equidigital number, since it uses as much as digits as its factorization.
202040311831 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
The spelling of 202040311831 in words is "two hundred two billion, forty million, three hundred eleven thousand, eight hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •