Base | Representation |
---|---|
bin | 11001001111100100100100… |
… | …011100010000100110100001 |
3 | 112120002112011210001211022002 |
4 | 121033210210130100212201 |
5 | 104022432430040201423 |
6 | 1032042240030253345 |
7 | 32246006232134663 |
oct | 3117444434204641 |
9 | 476075153054262 |
10 | 111021221022113 |
11 | 32413920a4a096 |
12 | 105507a6357255 |
13 | 49c4343bb97cc |
14 | 1d5b6548b2533 |
15 | cc7db3ed4228 |
hex | 64f9247109a1 |
111021221022113 has 2 divisors, whose sum is σ = 111021221022114. Its totient is φ = 111021221022112.
The previous prime is 111021221022071. The next prime is 111021221022253. The reversal of 111021221022113 is 311220122120111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 61145252728849 + 49875968293264 = 7819543^2 + 7062292^2 .
It is an emirp because it is prime and its reverse (311220122120111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111021221022113 - 28 = 111021221021857 is a prime.
It is not a weakly prime, because it can be changed into another prime (111021221022013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55510610511056 + 55510610511057.
It is an arithmetic number, because the mean of its divisors is an integer number (55510610511057).
Almost surely, 2111021221022113 is an apocalyptic number.
It is an amenable number.
111021221022113 is a deficient number, since it is larger than the sum of its proper divisors (1).
111021221022113 is an equidigital number, since it uses as much as digits as its factorization.
111021221022113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 111021221022113 its reverse (311220122120111), we get a palindrome (422241343142224).
The spelling of 111021221022113 in words is "one hundred eleven trillion, twenty-one billion, two hundred twenty-one million, twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •