Base | Representation |
---|---|
bin | 10100110000001000… |
… | …11011000000111001 |
3 | 1001202110012011021012 |
4 | 22120010123000321 |
5 | 140304123340044 |
6 | 5041311123305 |
7 | 543042620003 |
oct | 123004330071 |
9 | 31673164235 |
10 | 11141230649 |
11 | 47a7a3053a |
12 | 21ab213535 |
13 | 1087275b93 |
14 | 779955373 |
15 | 45318a59e |
hex | 29811b039 |
11141230649 has 2 divisors, whose sum is σ = 11141230650. Its totient is φ = 11141230648.
The previous prime is 11141230637. The next prime is 11141230669. The reversal of 11141230649 is 94603214111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5734275625 + 5406955024 = 75725^2 + 73532^2 .
It is a cyclic number.
It is not a de Polignac number, because 11141230649 - 220 = 11140182073 is a prime.
It is a super-2 number, since 2×111412306492 (a number of 21 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11141230609) 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, 5570615324 + 5570615325.
It is an arithmetic number, because the mean of its divisors is an integer number (5570615325).
Almost surely, 211141230649 is an apocalyptic number.
It is an amenable number.
11141230649 is a deficient number, since it is larger than the sum of its proper divisors (1).
11141230649 is an equidigital number, since it uses as much as digits as its factorization.
11141230649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 32.
The spelling of 11141230649 in words is "eleven billion, one hundred forty-one million, two hundred thirty thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •