Base | Representation |
---|---|
bin | 1001000111010000001110… |
… | …1110000010000001001111 |
3 | 1022110220221102210120102010 |
4 | 2101310003232002001033 |
5 | 2303132403100200421 |
6 | 33151120453232303 |
7 | 2052636264016035 |
oct | 221640356020117 |
9 | 38426842716363 |
10 | 10020221100111 |
11 | 3213608647902 |
12 | 1159b9b932693 |
13 | 578b97597511 |
14 | 268da492a555 |
15 | 1259b02d5076 |
hex | 91d03b8204f |
10020221100111 has 8 divisors (see below), whose sum is σ = 13670999330560. Its totient is φ = 6524795134872.
The previous prime is 10020221100101. The next prime is 10020221100121. The reversal of 10020221100111 is 11100112202001.
It is an interprime number because it is at equal distance from previous prime (10020221100101) and next prime (10020221100121).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10020221100111 - 210 = 10020221099087 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 (10020221100101) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 38838066151 + ... + 38838066408.
It is an arithmetic number, because the mean of its divisors is an integer number (1708874916320).
Almost surely, 210020221100111 is an apocalyptic number.
10020221100111 is a deficient number, since it is larger than the sum of its proper divisors (3650778230449).
10020221100111 is an equidigital number, since it uses as much as digits as its factorization.
10020221100111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 77676132605.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10020221100111 its reverse (11100112202001), we get a palindrome (21120333302112).
The spelling of 10020221100111 in words is "ten trillion, twenty billion, two hundred twenty-one million, one hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •