Base | Representation |
---|---|
bin | 11001000011101000110111… |
… | …100000101111010101000000 |
3 | 112110012010120021000001211221 |
4 | 121003220313200233111000 |
5 | 103421014030231210422 |
6 | 1030213422225244424 |
7 | 32132526344215366 |
oct | 3103506740572500 |
9 | 473163507001757 |
10 | 110201202210112 |
11 | 32128081787672 |
12 | 10439893793714 |
13 | 4964c0c6a9a60 |
14 | 1d2daa3969636 |
15 | cb18bd4ac3c7 |
hex | 643a3782f540 |
110201202210112 has 28 divisors (see below), whose sum is σ = 235502088378676. Its totient is φ = 50862093327360.
The previous prime is 110201202210061. The next prime is 110201202210131. The reversal of 110201202210112 is 211012202102011.
It can be written as a sum of positive squares in 2 ways, for example, as 40478301409536 + 69722900800576 = 6362256^2 + 8350024^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 66226683189 + ... + 66226684852.
It is an arithmetic number, because the mean of its divisors is an integer number (8410788870667).
Almost surely, 2110201202210112 is an apocalyptic number.
It is an amenable number.
110201202210112 is an abundant number, since it is smaller than the sum of its proper divisors (125300886168564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201202210112 is a wasteful number, since it uses less digits than its factorization.
110201202210112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 132453368066 (or 132453368056 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 110201202210112 its reverse (211012202102011), we get a palindrome (321213404312123).
The spelling of 110201202210112 in words is "one hundred ten trillion, two hundred one billion, two hundred two million, two hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •