Base | Representation |
---|---|
bin | 11001000010001100100101… |
… | …010010010110110111101110 |
3 | 112102211122210111200010002201 |
4 | 121002030211102112313232 |
5 | 103412403111210432342 |
6 | 1030100113450412114 |
7 | 32122420660103200 |
oct | 3102144522266756 |
9 | 472748714603081 |
10 | 110102112202222 |
11 | 3209a052a89068 |
12 | 1042263a73103a |
13 | 495877a581aaa |
14 | 1d28d83706770 |
15 | cae01e0c4db7 |
hex | 642325496dee |
110102112202222 has 24 divisors (see below), whose sum is σ = 192217378262976. Its totient is φ = 47161953141408.
The previous prime is 110102112202171. The next prime is 110102112202241. The reversal of 110102112202222 is 222202211201011.
It is a super-2 number, since 2×1101021122022222 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 110102112202222.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 293458878 + ... + 293833825.
It is an arithmetic number, because the mean of its divisors is an integer number (8009057427624).
Almost surely, 2110102112202222 is an apocalyptic number.
110102112202222 is a deficient number, since it is larger than the sum of its proper divisors (82115266060754).
110102112202222 is a wasteful number, since it uses less digits than its factorization.
110102112202222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 587294632 (or 587294625 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 110102112202222 its reverse (222202211201011), we get a palindrome (332304323403233).
The spelling of 110102112202222 in words is "one hundred ten trillion, one hundred two billion, one hundred twelve million, two hundred two thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •