Base | Representation |
---|---|
bin | 110011111000001000… |
… | …1001110110001110101 |
3 | 101122120000121010012212 |
4 | 1213300101032301311 |
5 | 3311124214344341 |
6 | 123102344423205 |
7 | 11022503561324 |
oct | 1476021166165 |
9 | 348500533185 |
10 | 111405231221 |
11 | 43279392129 |
12 | 19711477b05 |
13 | a67568a77b |
14 | 556ba980bb |
15 | 2d706725eb |
hex | 19f044ec75 |
111405231221 has 2 divisors, whose sum is σ = 111405231222. Its totient is φ = 111405231220.
The previous prime is 111405231193. The next prime is 111405231227. The reversal of 111405231221 is 122132504111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104028826225 + 7376404996 = 322535^2 + 85886^2 .
It is a cyclic number.
It is not a de Polignac number, because 111405231221 - 230 = 110331489397 is a prime.
It is a super-2 number, since 2×1114052312212 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111405231227) 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, 55702615610 + 55702615611.
It is an arithmetic number, because the mean of its divisors is an integer number (55702615611).
Almost surely, 2111405231221 is an apocalyptic number.
It is an amenable number.
111405231221 is a deficient number, since it is larger than the sum of its proper divisors (1).
111405231221 is an equidigital number, since it uses as much as digits as its factorization.
111405231221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 23.
Adding to 111405231221 its reverse (122132504111), we get a palindrome (233537735332).
The spelling of 111405231221 in words is "one hundred eleven billion, four hundred five million, two hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •