Base | Representation |
---|---|
bin | 11001000011101001101101… |
… | …101111101111010110010101 |
3 | 112110012012220200010212121122 |
4 | 121003221231233233112111 |
5 | 103421022411200041041 |
6 | 1030214052411453325 |
7 | 32132561033234546 |
oct | 3103515557572625 |
9 | 473165820125548 |
10 | 110202112112021 |
11 | 321284a9362416 |
12 | 10439aa8457245 |
13 | 496502605c457 |
14 | 1d2db4c7424cd |
15 | cb19232e2c4b |
hex | 643a6dbef595 |
110202112112021 has 8 divisors (see below), whose sum is σ = 115703710093920. Its totient is φ = 104813949140208.
The previous prime is 110202112111979. The next prime is 110202112112033. The reversal of 110202112112021 is 120211211202011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110202112112021 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110202112112041) 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, 28358750531 + ... + 28358754416.
It is an arithmetic number, because the mean of its divisors is an integer number (14462963761740).
Almost surely, 2110202112112021 is an apocalyptic number.
It is an amenable number.
110202112112021 is a deficient number, since it is larger than the sum of its proper divisors (5501597981899).
110202112112021 is an equidigital number, since it uses as much as digits as its factorization.
110202112112021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 56717505043.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110202112112021 its reverse (120211211202011), we get a palindrome (230413323314032).
The spelling of 110202112112021 in words is "one hundred ten trillion, two hundred two billion, one hundred twelve million, one hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •