Base | Representation |
---|---|
bin | 110011110010011100… |
… | …0001011001000000001 |
3 | 101122001200222022200122 |
4 | 1213210320023020001 |
5 | 3310231303111111 |
6 | 123031400230025 |
7 | 11014663236215 |
oct | 1474470131001 |
9 | 348050868618 |
10 | 111214113281 |
11 | 43190516417 |
12 | 1967946b315 |
13 | a644bc322b |
14 | 5550548945 |
15 | 2d5d9becdb |
hex | 19e4e0b201 |
111214113281 has 2 divisors, whose sum is σ = 111214113282. Its totient is φ = 111214113280.
The previous prime is 111214113259. The next prime is 111214113301. The reversal of 111214113281 is 182311412111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98561463025 + 12652650256 = 313945^2 + 112484^2 .
It is a cyclic number.
It is not a de Polignac number, because 111214113281 - 230 = 110140371457 is a prime.
It is a super-2 number, since 2×1112141132812 (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 111214113281.
It is not a weakly prime, because it can be changed into another prime (111214113211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55607056640 + 55607056641.
It is an arithmetic number, because the mean of its divisors is an integer number (55607056641).
Almost surely, 2111214113281 is an apocalyptic number.
It is an amenable number.
111214113281 is a deficient number, since it is larger than the sum of its proper divisors (1).
111214113281 is an equidigital number, since it uses as much as digits as its factorization.
111214113281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 384, while the sum is 26.
Adding to 111214113281 its reverse (182311412111), we get a palindrome (293525525392).
The spelling of 111214113281 in words is "one hundred eleven billion, two hundred fourteen million, one hundred thirteen thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •