Base | Representation |
---|---|
bin | 110011111000000101… |
… | …0000110111101110001 |
3 | 101122112220002021011021 |
4 | 1213300022012331301 |
5 | 3311123230123314 |
6 | 123102240415441 |
7 | 11022451654204 |
oct | 1476012067561 |
9 | 348486067137 |
10 | 111403364209 |
11 | 43278327445 |
12 | 19710917581 |
13 | a675185a27 |
14 | 556b72d93b |
15 | 2d70404324 |
hex | 19f0286f71 |
111403364209 has 2 divisors, whose sum is σ = 111403364210. Its totient is φ = 111403364208.
The previous prime is 111403364161. The next prime is 111403364231. The reversal of 111403364209 is 902463304111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75570010000 + 35833354209 = 274900^2 + 189297^2 .
It is an emirp because it is prime and its reverse (902463304111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111403364209 - 213 = 111403356017 is a prime.
It is not a weakly prime, because it can be changed into another prime (111403364909) 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, 55701682104 + 55701682105.
It is an arithmetic number, because the mean of its divisors is an integer number (55701682105).
Almost surely, 2111403364209 is an apocalyptic number.
It is an amenable number.
111403364209 is a deficient number, since it is larger than the sum of its proper divisors (1).
111403364209 is an equidigital number, since it uses as much as digits as its factorization.
111403364209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 34.
The spelling of 111403364209 in words is "one hundred eleven billion, four hundred three million, three hundred sixty-four thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •