Base | Representation |
---|---|
bin | 11001000010001100101010… |
… | …100001010110110000101011 |
3 | 112102211200000121220201110102 |
4 | 121002030222201112300223 |
5 | 103412403301201120021 |
6 | 1030100130304540015 |
7 | 32122423104406553 |
oct | 3102145241266053 |
9 | 472750017821412 |
10 | 110102200020011 |
11 | 3209a098609951 |
12 | 1042266402160b |
13 | 495879281b694 |
14 | 1d28d91246163 |
15 | cae026b7000b |
hex | 64232a856c2b |
110102200020011 has 8 divisors (see below), whose sum is σ = 110190827511360. Its totient is φ = 110013579239368.
The previous prime is 110102200019969. The next prime is 110102200020019. The reversal of 110102200020011 is 110020002201011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 110102200020011 - 246 = 39733455842347 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 110102200019974 and 110102200020001.
It is not an unprimeable number, because it can be changed into a prime (110102200020019) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 31411880 + ... + 34740618.
It is an arithmetic number, because the mean of its divisors is an integer number (13773853438920).
Almost surely, 2110102200020011 is an apocalyptic number.
110102200020011 is a deficient number, since it is larger than the sum of its proper divisors (88627491349).
110102200020011 is a wasteful number, since it uses less digits than its factorization.
110102200020011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3355353.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 110102200020011 its reverse (110020002201011), we get a palindrome (220122202221022).
The spelling of 110102200020011 in words is "one hundred ten trillion, one hundred two billion, two hundred million, twenty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •