Base | Representation |
---|---|
bin | 1001001101001011110001… |
… | …0011101010010101001111 |
3 | 1022211122220201002201011221 |
4 | 2103102330103222111033 |
5 | 2311320031132020421 |
6 | 33310010215224211 |
7 | 2063204062161310 |
oct | 223227423522517 |
9 | 38748821081157 |
10 | 10122102220111 |
11 | 3252839903232 |
12 | 1175893678067 |
13 | 585682a2a0cb |
14 | 26dcab73c607 |
15 | 12847474d841 |
hex | 934bc4ea54f |
10122102220111 has 8 divisors (see below), whose sum is σ = 11568136607744. Its totient is φ = 8676072778680.
The previous prime is 10122102220099. The next prime is 10122102220129. The reversal of 10122102220111 is 11102220122101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10122102220111 - 233 = 10113512285519 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 (10122102220141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5876386 + ... + 7401088.
It is an arithmetic number, because the mean of its divisors is an integer number (1446017075968).
Almost surely, 210122102220111 is an apocalyptic number.
10122102220111 is a deficient number, since it is larger than the sum of its proper divisors (1446034387633).
10122102220111 is an equidigital number, since it uses as much as digits as its factorization.
10122102220111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2473101.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 10122102220111 its reverse (11102220122101), we get a palindrome (21224322342212).
The spelling of 10122102220111 in words is "ten trillion, one hundred twenty-two billion, one hundred two million, two hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •