Base | Representation |
---|---|
bin | 1001001111101011101000… |
… | …10001101111100001100011 |
3 | 2122222112100211001102101201 |
4 | 10213311310101233201203 |
5 | 10131041400420121011 |
6 | 111123253132142031 |
7 | 4165540056300640 |
oct | 447656421574143 |
9 | 78875324042351 |
10 | 20330031020131 |
11 | 6528a10565238 |
12 | 234411a307917 |
13 | b46162a48b31 |
14 | 503d9b9a0dc7 |
15 | 253c6dc49cc1 |
hex | 127d7446f863 |
20330031020131 has 16 divisors (see below), whose sum is σ = 23293177318080. Its totient is φ = 17381625016320.
The previous prime is 20330031020099. The next prime is 20330031020149. The reversal of 20330031020131 is 13102013003302.
It is a cyclic number.
It is not a de Polignac number, because 20330031020131 - 25 = 20330031020099 is a prime.
It is a super-2 number, since 2×203300310201312 (a number of 27 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 = 20330031020099 and 20330031020108.
It is not an unprimeable number, because it can be changed into a prime (20330031020161) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8213571 + ... + 10398211.
It is an arithmetic number, because the mean of its divisors is an integer number (1455823582380).
Almost surely, 220330031020131 is an apocalyptic number.
20330031020131 is a deficient number, since it is larger than the sum of its proper divisors (2963146297949).
20330031020131 is a wasteful number, since it uses less digits than its factorization.
20330031020131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2188014.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 20330031020131 its reverse (13102013003302), we get a palindrome (33432044023433).
The spelling of 20330031020131 in words is "twenty trillion, three hundred thirty billion, thirty-one million, twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •