Base | Representation |
---|---|
bin | 11001000001000000001110… |
… | …001111000111111110101001 |
3 | 112102112211011101221120121110 |
4 | 121001000032033013332221 |
5 | 103410032202000201301 |
6 | 1025554313524500533 |
7 | 32113456110166344 |
oct | 3101001617077651 |
9 | 472484141846543 |
10 | 110020121100201 |
11 | 320682a9162624 |
12 | 1040a777b4a749 |
13 | 4950b11a99a00 |
14 | 1d2500634b45b |
15 | cabd20e000d6 |
hex | 64100e3c7fa9 |
110020121100201 has 48 divisors (see below), whose sum is σ = 160376359898880. Its totient is φ = 67052607560640.
The previous prime is 110020121100199. The next prime is 110020121100203. The reversal of 110020121100201 is 102001121020011.
It is an interprime number because it is at equal distance from previous prime (110020121100199) and next prime (110020121100203).
It is not a de Polignac number, because 110020121100201 - 21 = 110020121100199 is a prime.
It is not an unprimeable number, because it can be changed into a prime (110020121100203) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 189092790 + ... + 189673728.
It is an arithmetic number, because the mean of its divisors is an integer number (3341174164560).
Almost surely, 2110020121100201 is an apocalyptic number.
It is an amenable number.
110020121100201 is a deficient number, since it is larger than the sum of its proper divisors (50356238798679).
110020121100201 is a wasteful number, since it uses less digits than its factorization.
110020121100201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 584566 (or 584553 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 110020121100201 its reverse (102001121020011), we get a palindrome (212021242120212).
The spelling of 110020121100201 in words is "one hundred ten trillion, twenty billion, one hundred twenty-one million, one hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •