Base | Representation |
---|---|
bin | 11001011111010011001111… |
… | …000011011001101110100010 |
3 | 112200220212011111120100111100 |
4 | 121133103033003121232202 |
5 | 104143140120232413442 |
6 | 1034231000355055230 |
7 | 32420053020434532 |
oct | 3137231703315642 |
9 | 480825144510440 |
10 | 112102120201122 |
11 | 327a02733a2607 |
12 | 106a61852a1516 |
13 | 4a72252686c2c |
14 | 1d97ab32794c2 |
15 | ce6077b3284c |
hex | 65f4cf0d9ba2 |
112102120201122 has 48 divisors (see below), whose sum is σ = 242932863569760. Its totient is φ = 37360460860416.
The previous prime is 112102120201067. The next prime is 112102120201163. The reversal of 112102120201122 is 221102021201211.
112102120201122 is a `hidden beast` number, since 11 + 210 + 2 + 120 + 201 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 112102120201095 and 112102120201104.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3036086953 + ... + 3036123875.
It is an arithmetic number, because the mean of its divisors is an integer number (5061101324370).
Almost surely, 2112102120201122 is an apocalyptic number.
112102120201122 is an abundant number, since it is smaller than the sum of its proper divisors (130830743368638).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102120201122 is a wasteful number, since it uses less digits than its factorization.
112102120201122 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 63567 (or 63564 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 112102120201122 its reverse (221102021201211), we get a palindrome (333204141402333).
The spelling of 112102120201122 in words is "one hundred twelve trillion, one hundred two billion, one hundred twenty million, two hundred one thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •