Base | Representation |
---|---|
bin | 110100001010010100… |
… | …1010100100101001101 |
3 | 101201010112222022120101 |
4 | 1220110221110211031 |
5 | 3313401433314341 |
6 | 123243105251101 |
7 | 11043564156124 |
oct | 1502451244515 |
9 | 351115868511 |
10 | 112015526221 |
11 | 43561931865 |
12 | 19861933a91 |
13 | a741c4c281 |
14 | 55c8b60abb |
15 | 2da9025831 |
hex | 1a14a5494d |
112015526221 has 2 divisors, whose sum is σ = 112015526222. Its totient is φ = 112015526220.
The previous prime is 112015526177. The next prime is 112015526267. The reversal of 112015526221 is 122625510211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82360964196 + 29654562025 = 286986^2 + 172205^2 .
It is an emirp because it is prime and its reverse (122625510211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112015526221 - 219 = 112015001933 is a prime.
It is a super-2 number, since 2×1120155262212 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 112015526221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112015526281) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56007763110 + 56007763111.
It is an arithmetic number, because the mean of its divisors is an integer number (56007763111).
Almost surely, 2112015526221 is an apocalyptic number.
It is an amenable number.
112015526221 is a deficient number, since it is larger than the sum of its proper divisors (1).
112015526221 is an equidigital number, since it uses as much as digits as its factorization.
112015526221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2400, while the sum is 28.
The spelling of 112015526221 in words is "one hundred twelve billion, fifteen million, five hundred twenty-six thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •