Base | Representation |
---|---|
bin | 11110100101101010010… |
… | …001111111101100111011 |
3 | 21102221200112110000200011 |
4 | 132211222101333230323 |
5 | 233414420130010021 |
6 | 4245353340522351 |
7 | 304603032063025 |
oct | 36455221775473 |
9 | 7387615400604 |
10 | 2102022110011 |
11 | 74050a75508a |
12 | 29b476b503b7 |
13 | 1232b1c8cac5 |
14 | 73a4a2c3015 |
15 | 39a299e5de1 |
hex | 1e96a47fb3b |
2102022110011 has 4 divisors (see below), whose sum is σ = 2104474878792. Its totient is φ = 2099569341232.
The previous prime is 2102022109961. The next prime is 2102022110017. The reversal of 2102022110011 is 1100112202012.
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 2102022110011 - 27 = 2102022109883 is a prime.
It is a super-3 number, since 3×21020221100113 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2102022109973 and 2102022110000.
It is not an unprimeable number, because it can be changed into a prime (2102022110017) 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, 1226383105 + ... + 1226384818.
It is an arithmetic number, because the mean of its divisors is an integer number (526118719698).
Almost surely, 22102022110011 is an apocalyptic number.
2102022110011 is a deficient number, since it is larger than the sum of its proper divisors (2452768781).
2102022110011 is an equidigital number, since it uses as much as digits as its factorization.
2102022110011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2452768780.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2102022110011 its reverse (1100112202012), we get a palindrome (3202134312023).
The spelling of 2102022110011 in words is "two trillion, one hundred two billion, twenty-two million, one hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •