Base | Representation |
---|---|
bin | 11001000001000000001000… |
… | …010101110110111010010001 |
3 | 112102112210220111212000210011 |
4 | 121001000020111312322101 |
5 | 103410032001140431001 |
6 | 1025554300033034521 |
7 | 32113453466443402 |
oct | 3101001025667221 |
9 | 472483814760704 |
10 | 110020022202001 |
11 | 3206825835397a |
12 | 1040a74a9b5a41 |
13 | 4950ac7450872 |
14 | 1d24dd71659a9 |
15 | cabd173b6d51 |
hex | 641008576e91 |
110020022202001 has 16 divisors (see below), whose sum is σ = 110781788276880. Its totient is φ = 109260992655360.
The previous prime is 110020022201983. The next prime is 110020022202047. The reversal of 110020022202001 is 100202220020011.
It is a happy number.
It can be written as a sum of positive squares in 8 ways, for example, as 43948745478225 + 66071276723776 = 6629385^2 + 8128424^2 .
It is a cyclic number.
It is not a de Polignac number, because 110020022202001 - 211 = 110020022199953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110020022602001) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 576260565 + ... + 576451453.
It is an arithmetic number, because the mean of its divisors is an integer number (6923861767305).
Almost surely, 2110020022202001 is an apocalyptic number.
It is an amenable number.
110020022202001 is a deficient number, since it is larger than the sum of its proper divisors (761766074879).
110020022202001 is a wasteful number, since it uses less digits than its factorization.
110020022202001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198036.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 110020022202001 its reverse (100202220020011), we get a palindrome (210222242222012).
The spelling of 110020022202001 in words is "one hundred ten trillion, twenty billion, twenty-two million, two hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •