Base | Representation |
---|---|
bin | 1010000001011000110010… |
… | …0010110100001100000001 |
3 | 1110000101211111122012202012 |
4 | 2200112030202310030001 |
5 | 2421013301424114022 |
6 | 35234011343302305 |
7 | 2215043554360346 |
oct | 240261442641401 |
9 | 43011744565665 |
10 | 11018949051137 |
11 | 3569123526555 |
12 | 129b6678aa995 |
13 | 61c10c163551 |
14 | 2a146a04a7cd |
15 | 14196502cde2 |
hex | a058c8b4301 |
11018949051137 has 2 divisors, whose sum is σ = 11018949051138. Its totient is φ = 11018949051136.
The previous prime is 11018949051091. The next prime is 11018949051193. The reversal of 11018949051137 is 73115094981011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6403738974721 + 4615210076416 = 2530561^2 + 2148304^2 .
It is a cyclic number.
It is not a de Polignac number, because 11018949051137 - 28 = 11018949050881 is a prime.
It is not a weakly prime, because it can be changed into another prime (11018949051437) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5509474525568 + 5509474525569.
It is an arithmetic number, because the mean of its divisors is an integer number (5509474525569).
Almost surely, 211018949051137 is an apocalyptic number.
It is an amenable number.
11018949051137 is a deficient number, since it is larger than the sum of its proper divisors (1).
11018949051137 is an equidigital number, since it uses as much as digits as its factorization.
11018949051137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 272160, while the sum is 50.
The spelling of 11018949051137 in words is "eleven trillion, eighteen billion, nine hundred forty-nine million, fifty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •