Base | Representation |
---|---|
bin | 1001001000111111100011… |
… | …11100010111010001100100 |
3 | 2122011120011021100101202211 |
4 | 10210133301330113101210 |
5 | 10113310213021023022 |
6 | 110425524242013204 |
7 | 4143122653302244 |
oct | 444376174272144 |
9 | 78146137311684 |
10 | 20100211111012 |
11 | 644a4a7184a4a |
12 | 2307680047204 |
13 | b2a59876ac26 |
14 | 4d6bd9353b24 |
15 | 24ccbc8c1e77 |
hex | 1247f1f17464 |
20100211111012 has 12 divisors (see below), whose sum is σ = 37026704678320. Its totient is φ = 9521152631496.
The previous prime is 20100211111003. The next prime is 20100211111021. The reversal of 20100211111012 is 21011111200102.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (20100211111003) and next prime (20100211111021).
It is a junction number, because it is equal to n+sod(n) for n = 20100211110983 and 20100211111001.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 132238230918 + ... + 132238231069.
Almost surely, 220100211111012 is an apocalyptic number.
It is an amenable number.
20100211111012 is a deficient number, since it is larger than the sum of its proper divisors (16926493567308).
20100211111012 is a wasteful number, since it uses less digits than its factorization.
20100211111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264476462010 (or 264476462008 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20100211111012 its reverse (21011111200102), we get a palindrome (41111322311114).
It can be divided in two parts, 20100 and 211111012, that added together give a palindrome (211131112).
The spelling of 20100211111012 in words is "twenty trillion, one hundred billion, two hundred eleven million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •