Base | Representation |
---|---|
bin | 11001010010011111110000… |
… | …011000001011111001111101 |
3 | 112120210201222010011200212112 |
4 | 121102133300120023321331 |
5 | 104034231042004030411 |
6 | 1032314440043143405 |
7 | 32266353033600452 |
oct | 3122376030137175 |
9 | 476721863150775 |
10 | 111222211001981 |
11 | 3249109060a872 |
12 | 10583739514b65 |
13 | 4a0a295348091 |
14 | 1d67280253829 |
15 | ccd22930ab8b |
hex | 6527f060be7d |
111222211001981 has 2 divisors, whose sum is σ = 111222211001982. Its totient is φ = 111222211001980.
The previous prime is 111222211001971. The next prime is 111222211002011. The reversal of 111222211001981 is 189100112222111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71660186674756 + 39562024327225 = 8465234^2 + 6289835^2 .
It is a cyclic number.
It is not a de Polignac number, because 111222211001981 - 218 = 111222210739837 is a prime.
It is a super-4 number, since 4×1112222110019814 (a number of 57 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111222211001971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55611105500990 + 55611105500991.
It is an arithmetic number, because the mean of its divisors is an integer number (55611105500991).
Almost surely, 2111222211001981 is an apocalyptic number.
It is an amenable number.
111222211001981 is a deficient number, since it is larger than the sum of its proper divisors (1).
111222211001981 is an equidigital number, since it uses as much as digits as its factorization.
111222211001981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1152, while the sum is 32.
The spelling of 111222211001981 in words is "one hundred eleven trillion, two hundred twenty-two billion, two hundred eleven million, one thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •