Base | Representation |
---|---|
bin | 10100110000001010… |
… | …01000000111001011 |
3 | 1001202110112112122202 |
4 | 22120011020013023 |
5 | 140304200242441 |
6 | 5041315110415 |
7 | 543044316362 |
oct | 123005100713 |
9 | 31673475582 |
10 | 11141415371 |
11 | 47a80472a9 |
12 | 21ab2a240b |
13 | 108730bc98 |
14 | 7799a27d9 |
15 | 4531c519b |
hex | 2981481cb |
11141415371 has 2 divisors, whose sum is σ = 11141415372. Its totient is φ = 11141415370.
The previous prime is 11141415367. The next prime is 11141415379. The reversal of 11141415371 is 17351414111.
It is a weak prime.
It is an emirp because it is prime and its reverse (17351414111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11141415371 - 22 = 11141415367 is a prime.
It is a super-2 number, since 2×111414153712 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (11141415379) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5570707685 + 5570707686.
It is an arithmetic number, because the mean of its divisors is an integer number (5570707686).
Almost surely, 211141415371 is an apocalyptic number.
11141415371 is a deficient number, since it is larger than the sum of its proper divisors (1).
11141415371 is an equidigital number, since it uses as much as digits as its factorization.
11141415371 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1680, while the sum is 29.
Adding to 11141415371 its reverse (17351414111), we get a palindrome (28492829482).
The spelling of 11141415371 in words is "eleven billion, one hundred forty-one million, four hundred fifteen thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •