Base | Representation |
---|---|
bin | 110011111100001010… |
… | …1110100110000000001 |
3 | 101122220110102021001102 |
4 | 1213320111310300001 |
5 | 3311413401344212 |
6 | 123124023144145 |
7 | 11026036623221 |
oct | 1477025646001 |
9 | 348813367042 |
10 | 111540653057 |
11 | 433388775a9 |
12 | 1974a8a5055 |
13 | a697754032 |
14 | 5581a6a081 |
15 | 2d7c4c25c2 |
hex | 19f8574c01 |
111540653057 has 2 divisors, whose sum is σ = 111540653058. Its totient is φ = 111540653056.
The previous prime is 111540653051. The next prime is 111540653141. The reversal of 111540653057 is 750356045111.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 96323950321 + 15216702736 = 310361^2 + 123356^2 .
It is a cyclic number.
It is not a de Polignac number, because 111540653057 - 228 = 111272217601 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111540653057.
It is not a weakly prime, because it can be changed into another prime (111540653051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55770326528 + 55770326529.
It is an arithmetic number, because the mean of its divisors is an integer number (55770326529).
Almost surely, 2111540653057 is an apocalyptic number.
It is an amenable number.
111540653057 is a deficient number, since it is larger than the sum of its proper divisors (1).
111540653057 is an equidigital number, since it uses as much as digits as its factorization.
111540653057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63000, while the sum is 38.
Adding to 111540653057 its reverse (750356045111), we get a palindrome (861896698168).
The spelling of 111540653057 in words is "one hundred eleven billion, five hundred forty million, six hundred fifty-three thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •