Base | Representation |
---|---|
bin | 1001001101001011011101… |
… | …1010011001101111110111 |
3 | 1022211122200222120122002111 |
4 | 2103102313122121233313 |
5 | 2311314344121213421 |
6 | 33305554123151451 |
7 | 2063202044161312 |
oct | 223226732315767 |
9 | 38748628518074 |
10 | 10122020101111 |
11 | 32527a7514a96 |
12 | 1175870075587 |
13 | 58566ba07399 |
14 | 26dca0883979 |
15 | 12846c42bee1 |
hex | 934b7699bf7 |
10122020101111 has 4 divisors (see below), whose sum is σ = 10125899758800. Its totient is φ = 10118140443424.
The previous prime is 10122020101097. The next prime is 10122020101133. The reversal of 10122020101111 is 11110102022101.
It is a happy number.
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 10122020101111 - 221 = 10122018003959 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10122020101091 and 10122020101100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122020101511) 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, 1939824931 + ... + 1939830148.
It is an arithmetic number, because the mean of its divisors is an integer number (2531474939700).
Almost surely, 210122020101111 is an apocalyptic number.
10122020101111 is a deficient number, since it is larger than the sum of its proper divisors (3879657689).
10122020101111 is an equidigital number, since it uses as much as digits as its factorization.
10122020101111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3879657688.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10122020101111 its reverse (11110102022101), we get a palindrome (21232122123212).
The spelling of 10122020101111 in words is "ten trillion, one hundred twenty-two billion, twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •