Base | Representation |
---|---|
bin | 11001010101101110011100… |
… | …011010000111101011110011 |
3 | 112121120221210202201102210111 |
4 | 121111232130122013223303 |
5 | 104101400044433202402 |
6 | 1033004421551042151 |
7 | 32321400456441022 |
oct | 3125563432075363 |
9 | 477527722642714 |
10 | 111444140522227 |
11 | 32567215a89117 |
12 | 105ba755210357 |
13 | 4a251a2a10226 |
14 | 1d73cd49aa8b9 |
15 | cd3db7ada9d7 |
hex | 655b9c687af3 |
111444140522227 has 2 divisors, whose sum is σ = 111444140522228. Its totient is φ = 111444140522226.
The previous prime is 111444140522191. The next prime is 111444140522339. The reversal of 111444140522227 is 722225041444111.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111444140522227 is a prime.
It is a super-3 number, since 3×1114441405222273 (a number of 43 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111444140522227.
It is not a weakly prime, because it can be changed into another prime (111444140526227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55722070261113 + 55722070261114.
It is an arithmetic number, because the mean of its divisors is an integer number (55722070261114).
Almost surely, 2111444140522227 is an apocalyptic number.
111444140522227 is a deficient number, since it is larger than the sum of its proper divisors (1).
111444140522227 is an equidigital number, since it uses as much as digits as its factorization.
111444140522227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 143360, while the sum is 40.
Adding to 111444140522227 its reverse (722225041444111), we get a palindrome (833669181966338).
The spelling of 111444140522227 in words is "one hundred eleven trillion, four hundred forty-four billion, one hundred forty million, five hundred twenty-two thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •