Base | Representation |
---|---|
bin | 1001000111010000001110… |
… | …1010101011001011001111 |
3 | 1022110220221101010212021112 |
4 | 2101310003222223023033 |
5 | 2303132402334020421 |
6 | 33151120422322235 |
7 | 2052636253362323 |
oct | 221640352531317 |
9 | 38426841125245 |
10 | 10020220220111 |
11 | 32136080a6732 |
12 | 1159b9b58937b |
13 | 578b97349aca |
14 | 268da477b983 |
15 | 1259b01ae45b |
hex | 91d03aab2cf |
10020220220111 has 4 divisors (see below), whose sum is σ = 10020254446272. Its totient is φ = 10020185993952.
The previous prime is 10020220220083. The next prime is 10020220220147. The reversal of 10020220220111 is 11102202202001.
10020220220111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10020220220111 - 26 = 10020220220047 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 (10020220220611) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 16670111 + ... + 17260736.
It is an arithmetic number, because the mean of its divisors is an integer number (2505063611568).
Almost surely, 210020220220111 is an apocalyptic number.
10020220220111 is a deficient number, since it is larger than the sum of its proper divisors (34226161).
10020220220111 is an equidigital number, since it uses as much as digits as its factorization.
10020220220111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34226160.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 10020220220111 its reverse (11102202202001), we get a palindrome (21122422422112).
The spelling of 10020220220111 in words is "ten trillion, twenty billion, two hundred twenty million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •