Base | Representation |
---|---|
bin | 11001011111100101110000… |
… | …101000110100010001001001 |
3 | 112200222202111201122010211221 |
4 | 121133211300220310101021 |
5 | 104144001334304310441 |
6 | 1034244050224122041 |
7 | 32421355645506400 |
oct | 3137456050642111 |
9 | 480882451563757 |
10 | 112122011010121 |
11 | 327a8750222832 |
12 | 106a9bb6766321 |
13 | 4a740a25507b8 |
14 | 1d98a3cc5a637 |
15 | ce683ded08d1 |
hex | 65f970a34449 |
112122011010121 has 12 divisors (see below), whose sum is σ = 133202701749888. Its totient is φ = 94059802547592.
The previous prime is 112122011010101. The next prime is 112122011010151. The reversal of 112122011010121 is 121010110221211.
It is not a de Polignac number, because 112122011010121 - 219 = 112122010485833 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112122011010095 and 112122011010104.
It is not an unprimeable number, because it can be changed into a prime (112122011010101) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 24342596701 + ... + 24342601306.
It is an arithmetic number, because the mean of its divisors is an integer number (11100225145824).
Almost surely, 2112122011010121 is an apocalyptic number.
It is an amenable number.
112122011010121 is a deficient number, since it is larger than the sum of its proper divisors (21080690739767).
112122011010121 is an equidigital number, since it uses as much as digits as its factorization.
112122011010121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 48685198068 (or 48685198061 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 112122011010121 its reverse (121010110221211), we get a palindrome (233132121231332).
The spelling of 112122011010121 in words is "one hundred twelve trillion, one hundred twenty-two billion, eleven million, ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •