Base | Representation |
---|---|
bin | 1001001001000001000100… |
… | …01010011100110101111001 |
3 | 2122011122020122121211000202 |
4 | 10210200202022130311321 |
5 | 10113313342122011301 |
6 | 110430140421411545 |
7 | 4143152005546412 |
oct | 444404212346571 |
9 | 78148218554022 |
10 | 20101020110201 |
11 | 644a881902018 |
12 | 2307866b69bb5 |
13 | b2a697251c84 |
14 | 4d6c74982809 |
15 | 24cd1892566b |
hex | 12482229cd79 |
20101020110201 has 8 divisors (see below), whose sum is σ = 20109381308544. Its totient is φ = 20092659307920.
The previous prime is 20101020110183. The next prime is 20101020110221. The reversal of 20101020110201 is 10201102010102.
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 20101020110201 - 26 = 20101020110137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20101020110221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 144684896 + ... + 144823758.
It is an arithmetic number, because the mean of its divisors is an integer number (2513672663568).
Almost surely, 220101020110201 is an apocalyptic number.
It is an amenable number.
20101020110201 is a deficient number, since it is larger than the sum of its proper divisors (8361198343).
20101020110201 is a wasteful number, since it uses less digits than its factorization.
20101020110201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198031.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 20101020110201 its reverse (10201102010102), we get a palindrome (30302122120303).
The spelling of 20101020110201 in words is "twenty trillion, one hundred one billion, twenty million, one hundred ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •