Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100001010101000101000010 |
3 | 112102211200000121220101000021 |
4 | 121002030222201111011002 |
5 | 103412403301200404442 |
6 | 1030100130304444054 |
7 | 32122423104350512 |
oct | 3102145241250502 |
9 | 472750017811007 |
10 | 110102200013122 |
11 | 3209a098604759 |
12 | 1042266401962a |
13 | 49587928184c5 |
14 | 1d28d91243842 |
15 | cae026b6ce67 |
hex | 64232a855142 |
110102200013122 has 16 divisors (see below), whose sum is σ = 165206538142272. Its totient is φ = 55033356757680.
The previous prime is 110102200013041. The next prime is 110102200013123. The reversal of 110102200013122 is 221310002201011.
It is a junction number, because it is equal to n+sod(n) for n = 110102200013096 and 110102200013105.
It is not an unprimeable number, because it can be changed into a prime (110102200013123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 78908547 + ... + 80291737.
It is an arithmetic number, because the mean of its divisors is an integer number (10325408633892).
Almost surely, 2110102200013122 is an apocalyptic number.
110102200013122 is a deficient number, since it is larger than the sum of its proper divisors (55104338129150).
110102200013122 is a wasteful number, since it uses less digits than its factorization.
110102200013122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1395993.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 110102200013122 its reverse (221310002201011), we get a palindrome (331412202214133).
The spelling of 110102200013122 in words is "one hundred ten trillion, one hundred two billion, two hundred million, thirteen thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •