Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100001101111101010011100 |
3 | 112102211200000122002220101020 |
4 | 121002030222201233222130 |
5 | 103412403301212401022 |
6 | 1030100130311044140 |
7 | 32122423105313130 |
oct | 3102145241575234 |
9 | 472750018086336 |
10 | 110102200122012 |
11 | 3209a09867954a |
12 | 10422664070650 |
13 | 4958792855c37 |
14 | 1d28d912713c0 |
15 | cae026b9035c |
hex | 64232a86fa9c |
110102200122012 has 96 divisors (see below), whose sum is σ = 299870018058240. Its totient is φ = 30786689287680.
The previous prime is 110102200121909. The next prime is 110102200122097. The reversal of 110102200122012 is 210221002201011.
It is a junction number, because it is equal to n+sod(n) for n = 110102200121982 and 110102200122000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68728462 + ... + 70312202.
It is an arithmetic number, because the mean of its divisors is an integer number (3123646021440).
Almost surely, 2110102200122012 is an apocalyptic number.
110102200122012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110102200122012 is an abundant number, since it is smaller than the sum of its proper divisors (189767817936228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102200122012 is a wasteful number, since it uses less digits than its factorization.
110102200122012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1601411 (or 1601409 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110102200122012 its reverse (210221002201011), we get a palindrome (320323202323023).
The spelling of 110102200122012 in words is "one hundred ten trillion, one hundred two billion, two hundred million, one hundred twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •