Base | Representation |
---|---|
bin | 11001000001000000001000… |
… | …010101100000111100001011 |
3 | 112102112210220111200110100012 |
4 | 121001000020111200330023 |
5 | 103410032001130041021 |
6 | 1025554300031102135 |
7 | 32113453465620134 |
oct | 3101001025407413 |
9 | 472483814613305 |
10 | 110020022112011 |
11 | 320682582a2300 |
12 | 1040a74a97194b |
13 | 4950ac741b90b |
14 | 1d24dd7140c8b |
15 | cabd1739a35b |
hex | 641008560f0b |
110020022112011 has 6 divisors (see below), whose sum is σ = 120931098685236. Its totient is φ = 100018201919900.
The previous prime is 110020022111947. The next prime is 110020022112029. The reversal of 110020022112011 is 110211220020011.
It is not a de Polignac number, because 110020022112011 - 26 = 110020022111947 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (110020022112031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 454628190425 + ... + 454628190666.
It is an arithmetic number, because the mean of its divisors is an integer number (20155183114206).
Almost surely, 2110020022112011 is an apocalyptic number.
110020022112011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
110020022112011 is a deficient number, since it is larger than the sum of its proper divisors (10911076573225).
110020022112011 is an equidigital number, since it uses as much as digits as its factorization.
110020022112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 909256381113 (or 909256381102 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110020022112011 its reverse (110211220020011), we get a palindrome (220231242132022).
The spelling of 110020022112011 in words is "one hundred ten trillion, twenty billion, twenty-two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •