Base | Representation |
---|---|
bin | 10100110010010000… |
… | …10000110001110001 |
3 | 1001210200122200010211 |
4 | 22121020100301301 |
5 | 140323201431023 |
6 | 5043144224121 |
7 | 543350026003 |
oct | 123110206161 |
9 | 31720580124 |
10 | 11159014513 |
11 | 4806a77849 |
12 | 21b516b041 |
13 | 108ab6168a |
14 | 77c064373 |
15 | 4549eea0d |
hex | 299210c71 |
11159014513 has 2 divisors, whose sum is σ = 11159014514. Its totient is φ = 11159014512.
The previous prime is 11159014483. The next prime is 11159014543. The reversal of 11159014513 is 31541095111.
It is a balanced prime because it is at equal distance from previous prime (11159014483) and next prime (11159014543).
It can be written as a sum of positive squares in only one way, i.e., 10037635344 + 1121379169 = 100188^2 + 33487^2 .
It is a cyclic number.
It is not a de Polignac number, because 11159014513 - 213 = 11159006321 is a prime.
It is not a weakly prime, because it can be changed into another prime (11159014543) 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, 5579507256 + 5579507257.
It is an arithmetic number, because the mean of its divisors is an integer number (5579507257).
Almost surely, 211159014513 is an apocalyptic number.
It is an amenable number.
11159014513 is a deficient number, since it is larger than the sum of its proper divisors (1).
11159014513 is an equidigital number, since it uses as much as digits as its factorization.
11159014513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 31.
The spelling of 11159014513 in words is "eleven billion, one hundred fifty-nine million, fourteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •