Base | Representation |
---|---|
bin | 1001010010111000111010… |
… | …1100000011010111111011 |
3 | 1100012000220210221020021111 |
4 | 2110232032230003113323 |
5 | 2314421302001010021 |
6 | 33423020412221151 |
7 | 2103244062041521 |
oct | 224561654032773 |
9 | 40160823836244 |
10 | 10220121110011 |
11 | 3290368a23a5a |
12 | 1190889a6a7b7 |
13 | 5919a3c77547 |
14 | 274929620311 |
15 | 12acaeaa78e1 |
hex | 94b8eb035fb |
10220121110011 has 4 divisors (see below), whose sum is σ = 10242484613992. Its totient is φ = 10197757606032.
The previous prime is 10220121109987. The next prime is 10220121110033. The reversal of 10220121110011 is 11001112102201.
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 10220121110011 - 241 = 8021097854459 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10220121109973 and 10220121110000.
It is not an unprimeable number, because it can be changed into a prime (10220121110611) 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, 11181751305 + ... + 11181752218.
It is an arithmetic number, because the mean of its divisors is an integer number (2560621153498).
Almost surely, 210220121110011 is an apocalyptic number.
10220121110011 is a deficient number, since it is larger than the sum of its proper divisors (22363503981).
10220121110011 is an equidigital number, since it uses as much as digits as its factorization.
10220121110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22363503980.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 10220121110011 its reverse (11001112102201), we get a palindrome (21221233212212).
The spelling of 10220121110011 in words is "ten trillion, two hundred twenty billion, one hundred twenty-one million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •