Base | Representation |
---|---|
bin | 110011111000000100… |
… | …1100010010100111001 |
3 | 101122112212210122022001 |
4 | 1213300021202110321 |
5 | 3311123210323022 |
6 | 123102233301001 |
7 | 11022450460525 |
oct | 1476011422471 |
9 | 348485718261 |
10 | 111403214137 |
11 | 43278234716 |
12 | 19710864761 |
13 | a675132627 |
14 | 556b6d0d85 |
15 | 2d703c4b27 |
hex | 19f0262539 |
111403214137 has 2 divisors, whose sum is σ = 111403214138. Its totient is φ = 111403214136.
The previous prime is 111403214099. The next prime is 111403214149. The reversal of 111403214137 is 731412304111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 75825332496 + 35577881641 = 275364^2 + 188621^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111403214137 is a prime.
It is a super-2 number, since 2×1114032141372 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111403214737) 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, 55701607068 + 55701607069.
It is an arithmetic number, because the mean of its divisors is an integer number (55701607069).
Almost surely, 2111403214137 is an apocalyptic number.
It is an amenable number.
111403214137 is a deficient number, since it is larger than the sum of its proper divisors (1).
111403214137 is an equidigital number, since it uses as much as digits as its factorization.
111403214137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 28.
Adding to 111403214137 its reverse (731412304111), we get a palindrome (842815518248).
The spelling of 111403214137 in words is "one hundred eleven billion, four hundred three million, two hundred fourteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •