Base | Representation |
---|---|
bin | 1001001001010100001101… |
… | …11101101111000000010011 |
3 | 2122012121210011022210202122 |
4 | 10210222012331233000103 |
5 | 10114000421102211011 |
6 | 110435000525204455 |
7 | 4143664535502605 |
oct | 444520675570023 |
9 | 78177704283678 |
10 | 20111301210131 |
11 | 645417826161a |
12 | 230985610072b |
13 | b2b645250661 |
14 | 4d756c199175 |
15 | 24d21b30c3db |
hex | 124a86f6f013 |
20111301210131 has 16 divisors (see below), whose sum is σ = 21559901479200. Its totient is φ = 18692401110528.
The previous prime is 20111301210127. The next prime is 20111301210139. The reversal of 20111301210131 is 13101210311102.
It is a cyclic number.
It is not a de Polignac number, because 20111301210131 - 22 = 20111301210127 is a prime.
It is a super-2 number, since 2×201113012101312 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20111301210139) 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, 387785 + ... + 6353973.
It is an arithmetic number, because the mean of its divisors is an integer number (1347493842450).
Almost surely, 220111301210131 is an apocalyptic number.
20111301210131 is a deficient number, since it is larger than the sum of its proper divisors (1448600269069).
20111301210131 is a wasteful number, since it uses less digits than its factorization.
20111301210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5968678.
The product of its (nonzero) digits is 36, while the sum is 17.
Adding to 20111301210131 its reverse (13101210311102), we get a palindrome (33212511521233).
The spelling of 20111301210131 in words is "twenty trillion, one hundred eleven billion, three hundred one million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •