Base | Representation |
---|---|
bin | 11001000011101000110010… |
… | …000101001100001001000110 |
3 | 112110012010022220120022001020 |
4 | 121003220302011030021012 |
5 | 103421013333420231042 |
6 | 1030213405212412010 |
7 | 32132524156626213 |
oct | 3103506205141106 |
9 | 473163286508036 |
10 | 110201111102022 |
11 | 32128035309826 |
12 | 10439869177006 |
13 | 4964bc685a645 |
14 | 1d2da95810b0a |
15 | cb18b54b23ec |
hex | 643a3214c246 |
110201111102022 has 8 divisors (see below), whose sum is σ = 220402222204056. Its totient is φ = 36733703700672.
The previous prime is 110201111101973. The next prime is 110201111102119. The reversal of 110201111102022 is 220201111102011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
110201111102022 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 110201111101992 and 110201111102010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9183425925163 + ... + 9183425925174.
It is an arithmetic number, because the mean of its divisors is an integer number (27550277775507).
Almost surely, 2110201111102022 is an apocalyptic number.
110201111102022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110201111102022 is a wasteful number, since it uses less digits than its factorization.
110201111102022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18366851850342.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110201111102022 its reverse (220201111102011), we get a palindrome (330402222204033).
The spelling of 110201111102022 in words is "one hundred ten trillion, two hundred one billion, one hundred eleven million, one hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •