Base | Representation |
---|---|
bin | 101101111100000100011010… |
… | …100000100000011000111111 |
3 | 222111100211120001222111100021 |
4 | 231330010122200200120333 |
5 | 202440210410313100111 |
6 | 1553411521213113011 |
7 | 60361623402256546 |
oct | 5574043240403077 |
9 | 874324501874307 |
10 | 202040001300031 |
11 | 5941575761a984 |
12 | 1a7b0857788767 |
13 | 88973a0c3c44b |
14 | 37c6b06cdd15d |
15 | 18557cdc0dd71 |
hex | b7c11a82063f |
202040001300031 has 12 divisors (see below), whose sum is σ = 216762108214120. Its totient is φ = 187794877027680.
The previous prime is 202040001300013. The next prime is 202040001300079. The reversal of 202040001300031 is 130003100040202.
It is a happy number.
It is not a de Polignac number, because 202040001300031 - 29 = 202040001299519 is a prime.
It is a super-2 number, since 2×2020400013000312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 202040001299978 and 202040001300014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202040001300001) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1892734860 + ... + 1892841601.
Almost surely, 2202040001300031 is an apocalyptic number.
202040001300031 is a deficient number, since it is larger than the sum of its proper divisors (14722106914089).
202040001300031 is an equidigital number, since it uses as much as digits as its factorization.
202040001300031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3785576586 (or 3785576533 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 202040001300031 its reverse (130003100040202), we get a palindrome (332043101340233).
The spelling of 202040001300031 in words is "two hundred two trillion, forty billion, one million, three hundred thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •