Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100010000111100101110110 |
3 | 112102211200000122021212211020 |
4 | 121002030222202013211312 |
5 | 103412403301224020042 |
6 | 1030100130313122010 |
7 | 32122423106201643 |
oct | 3102145242074566 |
9 | 472750018255736 |
10 | 110102200220022 |
11 | 3209a09873614a |
12 | 104226640b9306 |
13 | 495879288b72a |
14 | 1d28d91298dca |
15 | cae026bae3ec |
hex | 64232a887976 |
110102200220022 has 16 divisors (see below), whose sum is σ = 220204504632000. Its totient is φ = 36700716041352.
The previous prime is 110102200219943. The next prime is 110102200220107. The reversal of 110102200220022 is 220022002201011.
It is a junction number, because it is equal to n+sod(n) for n = 110102200219983 and 110102200220010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19295913 + ... + 24342075.
It is an arithmetic number, because the mean of its divisors is an integer number (13762781539500).
Almost surely, 2110102200220022 is an apocalyptic number.
110102200220022 is an abundant number, since it is smaller than the sum of its proper divisors (110102304411978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102200220022 is a wasteful number, since it uses less digits than its factorization.
110102200220022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8682667.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 110102200220022 its reverse (220022002201011), we get a palindrome (330124202421033).
The spelling of 110102200220022 in words is "one hundred ten trillion, one hundred two billion, two hundred million, two hundred twenty thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •