Base | Representation |
---|---|
bin | 110011101100011101… |
… | …0001011001100011001 |
3 | 101121112201010112002122 |
4 | 1213120322023030121 |
5 | 3304323401430012 |
6 | 122555424311025 |
7 | 11010004401452 |
oct | 1473072131431 |
9 | 347481115078 |
10 | 111013311257 |
11 | 43098135932 |
12 | 19622172475 |
13 | a612417b74 |
14 | 55319d8129 |
15 | 2d4b057e72 |
hex | 19d8e8b319 |
111013311257 has 2 divisors, whose sum is σ = 111013311258. Its totient is φ = 111013311256.
The previous prime is 111013311223. The next prime is 111013311263. The reversal of 111013311257 is 752113310111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102649111321 + 8364199936 = 320389^2 + 91456^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111013311257 is a prime.
It is not a weakly prime, because it can be changed into another prime (111013317257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55506655628 + 55506655629.
It is an arithmetic number, because the mean of its divisors is an integer number (55506655629).
Almost surely, 2111013311257 is an apocalyptic number.
It is an amenable number.
111013311257 is a deficient number, since it is larger than the sum of its proper divisors (1).
111013311257 is an equidigital number, since it uses as much as digits as its factorization.
111013311257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 26.
Adding to 111013311257 its reverse (752113310111), we get a palindrome (863126621368).
The spelling of 111013311257 in words is "one hundred eleven billion, thirteen million, three hundred eleven thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •