Base | Representation |
---|---|
bin | 110011111000000011… |
… | …0011110010110010101 |
3 | 101122112211021212011112 |
4 | 1213300012132112111 |
5 | 3311123004131123 |
6 | 123102204144405 |
7 | 11022440605316 |
oct | 1476006362625 |
9 | 348484255145 |
10 | 111402411413 |
11 | 43277836607 |
12 | 19710538105 |
13 | a674c11147 |
14 | 556b56260d |
15 | 2d702b6d78 |
hex | 19f019e595 |
111402411413 has 2 divisors, whose sum is σ = 111402411414. Its totient is φ = 111402411412.
The previous prime is 111402411389. The next prime is 111402411437. The reversal of 111402411413 is 314114204111.
It is a balanced prime because it is at equal distance from previous prime (111402411389) and next prime (111402411437).
It can be written as a sum of positive squares in only one way, i.e., 106238839249 + 5163572164 = 325943^2 + 71858^2 .
It is a cyclic number.
It is not a de Polignac number, because 111402411413 - 212 = 111402407317 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111402411443) 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, 55701205706 + 55701205707.
It is an arithmetic number, because the mean of its divisors is an integer number (55701205707).
Almost surely, 2111402411413 is an apocalyptic number.
It is an amenable number.
111402411413 is a deficient number, since it is larger than the sum of its proper divisors (1).
111402411413 is an equidigital number, since it uses as much as digits as its factorization.
111402411413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 111402411413 its reverse (314114204111), we get a palindrome (425516615524).
The spelling of 111402411413 in words is "one hundred eleven billion, four hundred two million, four hundred eleven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •