Base | Representation |
---|---|
bin | 11001000000101110011011… |
… | …110110100111000010011011 |
3 | 112102110222212101000000122211 |
4 | 121000232123312213002123 |
5 | 103404224043140431021 |
6 | 1025541434425055551 |
7 | 32112211606220413 |
oct | 3100563366470233 |
9 | 472428771000584 |
10 | 110001022202011 |
11 | 32060198348746 |
12 | 10406b279275b7 |
13 | 494c089cb3115 |
14 | 1d241139cb643 |
15 | cab5a432c3e1 |
hex | 640b9bda709b |
110001022202011 has 8 divisors (see below), whose sum is σ = 110557685612000. Its totient is φ = 109444397736960.
The previous prime is 110001022201949. The next prime is 110001022202033. The reversal of 110001022202011 is 110202220100011.
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 110001022202011 - 235 = 109966662463643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110001022201982 and 110001022202000.
It is not an unprimeable number, because it can be changed into a prime (110001022232011) 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, 4064550 + ... + 15379291.
It is an arithmetic number, because the mean of its divisors is an integer number (13819710701500).
Almost surely, 2110001022202011 is an apocalyptic number.
110001022202011 is a deficient number, since it is larger than the sum of its proper divisors (556663409989).
110001022202011 is a wasteful number, since it uses less digits than its factorization.
110001022202011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19472469.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110001022202011 its reverse (110202220100011), we get a palindrome (220203242302022).
The spelling of 110001022202011 in words is "one hundred ten trillion, one billion, twenty-two million, two hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •