Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100001101111011010111110 |
3 | 112102211200000122002212000120 |
4 | 121002030222201233122332 |
5 | 103412403301212333042 |
6 | 1030100130311035410 |
7 | 32122423105310214 |
oct | 3102145241573276 |
9 | 472750018085016 |
10 | 110102200121022 |
11 | 3209a09867882a |
12 | 1042266406bb66 |
13 | 4958792855655 |
14 | 1d28d91270cb4 |
15 | cae026b8edec |
hex | 64232a86f6be |
110102200121022 has 64 divisors (see below), whose sum is σ = 226533220798464. Its totient is φ = 35649260300160.
The previous prime is 110102200121021. The next prime is 110102200121041. The reversal of 110102200121022 is 220121002201011.
It is a super-2 number, since 2×1101022001210222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110102200120992 and 110102200121010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110102200121021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 817982947 + ... + 818117537.
It is an arithmetic number, because the mean of its divisors is an integer number (3539581574976).
Almost surely, 2110102200121022 is an apocalyptic number.
110102200121022 is an abundant number, since it is smaller than the sum of its proper divisors (116431020677442).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110102200121022 is a wasteful number, since it uses less digits than its factorization.
110102200121022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140753.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 110102200121022 its reverse (220121002201011), we get a palindrome (330223202322033).
The spelling of 110102200121022 in words is "one hundred ten trillion, one hundred two billion, two hundred million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •