Base | Representation |
---|---|
bin | 1001000110011101001001… |
… | …00010110001011111111011 |
3 | 2121212020002022010010101101 |
4 | 10203032210202301133323 |
5 | 10110343122340224011 |
6 | 110321503520232231 |
7 | 4133615060341633 |
oct | 443164442613773 |
9 | 77766068103341 |
10 | 20013013211131 |
11 | 6416520246186 |
12 | 22b27a576b677 |
13 | b222b032ca75 |
14 | 4d28c66656c3 |
15 | 24a8b75472c1 |
hex | 1233a48b17fb |
20013013211131 has 16 divisors (see below), whose sum is σ = 21471985012320. Its totient is φ = 18586207467520.
The previous prime is 20013013211123. The next prime is 20013013211189. The reversal of 20013013211131 is 13111231031002.
It is a cyclic number.
It is not a de Polignac number, because 20013013211131 - 23 = 20013013211123 is a prime.
It is a super-2 number, since 2×200130132111312 (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 = 20013013211099 and 20013013211108.
It is not an unprimeable number, because it can be changed into a prime (20013013211101) 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, 12726946 + ... + 14212711.
It is an arithmetic number, because the mean of its divisors is an integer number (1341999063270).
Almost surely, 220013013211131 is an apocalyptic number.
20013013211131 is a deficient number, since it is larger than the sum of its proper divisors (1458971801189).
20013013211131 is a wasteful number, since it uses less digits than its factorization.
20013013211131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26940254.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 20013013211131 its reverse (13111231031002), we get a palindrome (33124244242133).
The spelling of 20013013211131 in words is "twenty trillion, thirteen billion, thirteen million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •