Base | Representation |
---|---|
bin | 1001000110011001011100… |
… | …10101110110001111111111 |
3 | 2121212000222002120012201221 |
4 | 10203030232111312033333 |
5 | 10110330042202024411 |
6 | 110320535035414211 |
7 | 4133514660305365 |
oct | 443145625661777 |
9 | 77760862505657 |
10 | 20011030111231 |
11 | 64156a28a1945 |
12 | 22b23315b4367 |
13 | b22055521b83 |
14 | 4d2779129635 |
15 | 24a7ed3c2071 |
hex | 12332e5763ff |
20011030111231 has 8 divisors (see below), whose sum is σ = 20052250882128. Its totient is φ = 19969811232000.
The previous prime is 20011030111201. The next prime is 20011030111249. The reversal of 20011030111231 is 13211103011002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20011030111231 - 25 = 20011030111199 is a prime.
It is a super-2 number, since 2×200110301112312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011030111201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21782941 + ... + 22683001.
It is an arithmetic number, because the mean of its divisors is an integer number (2506531360266).
Almost surely, 220011030111231 is an apocalyptic number.
20011030111231 is a deficient number, since it is larger than the sum of its proper divisors (41220770897).
20011030111231 is an equidigital number, since it uses as much as digits as its factorization.
20011030111231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 945833.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 20011030111231 its reverse (13211103011002), we get a palindrome (33222133122233).
The spelling of 20011030111231 in words is "twenty trillion, eleven billion, thirty million, one hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •