Base | Representation |
---|---|
bin | 1001001000111111001101… |
… | …00111100100110110010011 |
3 | 2122011112200000211110102012 |
4 | 10210133212213210312103 |
5 | 10113304320401042321 |
6 | 110425453333413135 |
7 | 4143115155321005 |
oct | 444374647446623 |
9 | 78145600743365 |
10 | 20100021112211 |
11 | 644a409a03047 |
12 | 230762849a1ab |
13 | b2a5682a5bc1 |
14 | 4d6bbc016375 |
15 | 24ccaad9105b |
hex | 1247e69e4d93 |
20100021112211 has 32 divisors (see below), whose sum is σ = 20753518705920. Its totient is φ = 19455113779200.
The previous prime is 20100021112159. The next prime is 20100021112243. The reversal of 20100021112211 is 11221112000102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20100021112211 is a prime.
It is a super-2 number, since 2×201000211122112 (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 (20100021112711) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2462931971 + ... + 2462940131.
It is an arithmetic number, because the mean of its divisors is an integer number (648547459560).
Almost surely, 220100021112211 is an apocalyptic number.
20100021112211 is a deficient number, since it is larger than the sum of its proper divisors (653497593709).
20100021112211 is a wasteful number, since it uses less digits than its factorization.
20100021112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9395.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 20100021112211 its reverse (11221112000102), we get a palindrome (31321133112313).
It can be divided in two parts, 2010002 and 1112211, that added together give a palindrome (3122213).
The spelling of 20100021112211 in words is "twenty trillion, one hundred billion, twenty-one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •