Base | Representation |
---|---|
bin | 11001000000111000110111… |
… | …011011010000010000011101 |
3 | 112102112001202220210102210022 |
4 | 121000320313123100100131 |
5 | 103404420012341223401 |
6 | 1025550530040121525 |
7 | 32113056264556220 |
oct | 3100706733202035 |
9 | 472461686712708 |
10 | 110012222211101 |
11 | 32064a15475301 |
12 | 104091327662a5 |
13 | 4950153498c32 |
14 | 1d248972835b7 |
15 | caba0c72871b |
hex | 640e376d041d |
110012222211101 has 64 divisors (see below), whose sum is σ = 135954130045440. Its totient is φ = 86929459200000.
The previous prime is 110012222210999. The next prime is 110012222211103. The reversal of 110012222211101 is 101112222210011.
It is a cyclic number.
It is not a de Polignac number, because 110012222211101 - 218 = 110012221948957 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110012222211101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110012222211103) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2157034601 + ... + 2157085601.
It is an arithmetic number, because the mean of its divisors is an integer number (2124283281960).
Almost surely, 2110012222211101 is an apocalyptic number.
It is an amenable number.
110012222211101 is a deficient number, since it is larger than the sum of its proper divisors (25941907834339).
110012222211101 is a wasteful number, since it uses less digits than its factorization.
110012222211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53926.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110012222211101 its reverse (101112222210011), we get a palindrome (211124444421112).
The spelling of 110012222211101 in words is "one hundred ten trillion, twelve billion, two hundred twenty-two million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •