Base | Representation |
---|---|
bin | 10100011111110010… |
… | …10111100010110001 |
3 | 1001101220011222010022 |
4 | 22033321113202301 |
5 | 140014023140441 |
6 | 5015532213225 |
7 | 536456302166 |
oct | 121771274261 |
9 | 31356158108 |
10 | 11004115121 |
11 | 473759961a |
12 | 217130a215 |
13 | 1064a3872c |
14 | 76566206d |
15 | 44610384b |
hex | 28fe578b1 |
11004115121 has 2 divisors, whose sum is σ = 11004115122. Its totient is φ = 11004115120.
The previous prime is 11004115103. The next prime is 11004115159. The reversal of 11004115121 is 12151140011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8129546896 + 2874568225 = 90164^2 + 53615^2 .
It is a cyclic number.
It is not a de Polignac number, because 11004115121 - 226 = 10937006257 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11004115121.
It is not a weakly prime, because it can be changed into another prime (11004115621) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502057560 + 5502057561.
It is an arithmetic number, because the mean of its divisors is an integer number (5502057561).
Almost surely, 211004115121 is an apocalyptic number.
It is an amenable number.
11004115121 is a deficient number, since it is larger than the sum of its proper divisors (1).
11004115121 is an equidigital number, since it uses as much as digits as its factorization.
11004115121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40, while the sum is 17.
Adding to 11004115121 its reverse (12151140011), we get a palindrome (23155255132).
The spelling of 11004115121 in words is "eleven billion, four million, one hundred fifteen thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •