Base | Representation |
---|---|
bin | 1001000111001111110100… |
… | …1010110111110110001111 |
3 | 1022110220122210001002101111 |
4 | 2101303331022313312033 |
5 | 2303132141433020421 |
6 | 33151101530152451 |
7 | 2052633461034136 |
oct | 221637512676617 |
9 | 38426583032344 |
10 | 10020111220111 |
11 | 3213561618393 |
12 | 1159b6ab82727 |
13 | 578b7a8a4975 |
14 | 268d940c691d |
15 | 1259a582cee1 |
hex | 91cfd2b7d8f |
10020111220111 has 8 divisors (see below), whose sum is σ = 10071013376000. Its totient is φ = 9969214563000.
The previous prime is 10020111220043. The next prime is 10020111220123. The reversal of 10020111220111 is 11102211102001.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10020111220111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10020111220091 and 10020111220100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10020111220181) 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, 2303986 + ... + 5034736.
It is an arithmetic number, because the mean of its divisors is an integer number (1258876672000).
Almost surely, 210020111220111 is an apocalyptic number.
10020111220111 is a deficient number, since it is larger than the sum of its proper divisors (50902155889).
10020111220111 is a wasteful number, since it uses less digits than its factorization.
10020111220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2749389.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10020111220111 its reverse (11102211102001), we get a palindrome (21122322322112).
The spelling of 10020111220111 in words is "ten trillion, twenty billion, one hundred eleven million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •