Base | Representation |
---|---|
bin | 11001000001000001111111… |
… | …011011100111101000110011 |
3 | 112102120000001202102220011111 |
4 | 121001001333123213220303 |
5 | 103410100044132413021 |
6 | 1025555230205054151 |
7 | 32113554140242402 |
oct | 3101017733475063 |
9 | 472500052386144 |
10 | 110022020201011 |
11 | 32069093154126 |
12 | 1040b007b57357 |
13 | 49510553771b9 |
14 | 1d2514665d639 |
15 | cabdd29d18e1 |
hex | 64107f6e7a33 |
110022020201011 has 16 divisors (see below), whose sum is σ = 111516898222080. Its totient is φ = 108538679954880.
The previous prime is 110022020200991. The next prime is 110022020201053. The reversal of 110022020201011 is 110102020220011.
It is a cyclic number.
It is not a de Polignac number, because 110022020201011 - 227 = 110021885983283 is a prime.
It is a super-2 number, since 2×1100220202010112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110022020200982 and 110022020201000.
It is not an unprimeable number, because it can be changed into a prime (110022020201911) 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, 12748920 + ... + 19559626.
It is an arithmetic number, because the mean of its divisors is an integer number (6969806138880).
Almost surely, 2110022020201011 is an apocalyptic number.
110022020201011 is a deficient number, since it is larger than the sum of its proper divisors (1494878021069).
110022020201011 is a wasteful number, since it uses less digits than its factorization.
110022020201011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6811554.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 110022020201011 its reverse (110102020220011), we get a palindrome (220124040421022).
The spelling of 110022020201011 in words is "one hundred ten trillion, twenty-two billion, twenty million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •