Base | Representation |
---|---|
bin | 110011110101101010… |
… | …0001000000111000011 |
3 | 101122100020011211110111 |
4 | 1213223110020013003 |
5 | 3310441424314014 |
6 | 123050215012151 |
7 | 11020444162552 |
oct | 1475324100703 |
9 | 348306154414 |
10 | 111322104259 |
11 | 43236475663 |
12 | 196a966a057 |
13 | a6613a4012 |
14 | 5560a19d99 |
15 | 2d682022c4 |
hex | 19eb5081c3 |
111322104259 has 2 divisors, whose sum is σ = 111322104260. Its totient is φ = 111322104258.
The previous prime is 111322104211. The next prime is 111322104301. The reversal of 111322104259 is 952401223111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 111322104259 - 229 = 110785233347 is a prime.
It is a super-2 number, since 2×1113221042592 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 111322104259.
It is not a weakly prime, because it can be changed into another prime (111322104209) 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, 55661052129 + 55661052130.
It is an arithmetic number, because the mean of its divisors is an integer number (55661052130).
Almost surely, 2111322104259 is an apocalyptic number.
111322104259 is a deficient number, since it is larger than the sum of its proper divisors (1).
111322104259 is an equidigital number, since it uses as much as digits as its factorization.
111322104259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4320, while the sum is 31.
The spelling of 111322104259 in words is "one hundred eleven billion, three hundred twenty-two million, one hundred four thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •