Base | Representation |
---|---|
bin | 1001000110010111111011… |
… | …00001100111010010100101 |
3 | 2121211221212000110202010211 |
4 | 10203023331201213102211 |
5 | 10110321403021041401 |
6 | 110320321501415421 |
7 | 4133455454032000 |
oct | 443137541472245 |
9 | 77757760422124 |
10 | 20010211112101 |
11 | 6415312564761 |
12 | 22b214326a571 |
13 | b21c549492c2 |
14 | 4d26dc456537 |
15 | 24a7a1545951 |
hex | 1232fd8674a5 |
20010211112101 has 16 divisors (see below), whose sum is σ = 24350111136000. Its totient is φ = 16405887364944.
The previous prime is 20010211112071. The next prime is 20010211112149. The reversal of 20010211112101 is 10121111201002.
It is a happy number.
It is not a de Polignac number, because 20010211112101 - 217 = 20010210981029 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010214112101) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1268227066 + ... + 1268242843.
It is an arithmetic number, because the mean of its divisors is an integer number (1521881946000).
Almost surely, 220010211112101 is an apocalyptic number.
It is an amenable number.
20010211112101 is a deficient number, since it is larger than the sum of its proper divisors (4339900023899).
20010211112101 is an equidigital number, since it uses as much as digits as its factorization.
20010211112101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2536469953 (or 2536469939 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20010211112101 its reverse (10121111201002), we get a palindrome (30131322313103).
The spelling of 20010211112101 in words is "twenty trillion, ten billion, two hundred eleven million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •