Base | Representation |
---|---|
bin | 1001001001100100101000… |
… | …00100110101101101011001 |
3 | 2122020110112010201010210110 |
4 | 10210302110010311231121 |
5 | 10114121441421023001 |
6 | 110443015040034533 |
7 | 4144426052434026 |
oct | 444622404655531 |
9 | 78213463633713 |
10 | 20120111111001 |
11 | 6457989212530 |
12 | 230b4b4602a49 |
13 | b2c41a502055 |
14 | 4d7b6624854d |
15 | 24d5849883d6 |
hex | 124c94135b59 |
20120111111001 has 16 divisors (see below), whose sum is σ = 29555374742208. Its totient is φ = 12073273992000.
The previous prime is 20120111110949. The next prime is 20120111111017. The reversal of 20120111111001 is 10011111102102.
It is not a de Polignac number, because 20120111111001 - 219 = 20120110586713 is a prime.
It is a super-2 number, since 2×201201111110012 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20120111111071) 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, 3018315166 + ... + 3018321831.
It is an arithmetic number, because the mean of its divisors is an integer number (1847210921388).
Almost surely, 220120111111001 is an apocalyptic number.
It is an amenable number.
20120111111001 is a deficient number, since it is larger than the sum of its proper divisors (9435263631207).
20120111111001 is a wasteful number, since it uses less digits than its factorization.
20120111111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6036637112.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 20120111111001 its reverse (10011111102102), we get a palindrome (30131222213103).
It can be divided in two parts, 20 and 120111111001, that added together give a palindrome (120111111021).
The spelling of 20120111111001 in words is "twenty trillion, one hundred twenty billion, one hundred eleven million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •