Base | Representation |
---|---|
bin | 1001000110010111111011… |
… | …00010000001101010100011 |
3 | 2121211221212000200020022221 |
4 | 10203023331202001222203 |
5 | 10110321403033021011 |
6 | 110320321504011511 |
7 | 4133455454661646 |
oct | 443137542015243 |
9 | 77757760606287 |
10 | 20010211220131 |
11 | 6415312628940 |
12 | 22b2143300b97 |
13 | b21c54986522 |
14 | 4d26dc483a5d |
15 | 24a7a1567971 |
hex | 1232fd881aa3 |
20010211220131 has 16 divisors (see below), whose sum is σ = 23738085525600. Its totient is φ = 16658305620480.
The previous prime is 20010211220117. The next prime is 20010211220149. The reversal of 20010211220131 is 13102211201002.
It is a cyclic number.
It is not a de Polignac number, because 20010211220131 - 25 = 20010211220099 is a prime.
It is a super-2 number, since 2×200102112201312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20010211220161) 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, 1446026556 + ... + 1446040393.
It is an arithmetic number, because the mean of its divisors is an integer number (1483630345350).
Almost surely, 220010211220131 is an apocalyptic number.
20010211220131 is a deficient number, since it is larger than the sum of its proper divisors (3727874305469).
20010211220131 is a wasteful number, since it uses less digits than its factorization.
20010211220131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2892067014.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20010211220131 its reverse (13102211201002), we get a palindrome (33112422421133).
The spelling of 20010211220131 in words is "twenty trillion, ten billion, two hundred eleven million, two hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •