Base | Representation |
---|---|
bin | 10100100011000011… |
… | …01011110100100001 |
3 | 1001110210122021211022 |
4 | 22101201223310201 |
5 | 140043023224103 |
6 | 5022350255225 |
7 | 540240605216 |
oct | 122141536441 |
9 | 31423567738 |
10 | 11031461153 |
11 | 4750a77049 |
12 | 217a4b7515 |
13 | 106a5c170b |
14 | 76913db0d |
15 | 448706138 |
hex | 29186bd21 |
11031461153 has 2 divisors, whose sum is σ = 11031461154. Its totient is φ = 11031461152.
The previous prime is 11031461117. The next prime is 11031461179. The reversal of 11031461153 is 35116413011.
It is a happy number.
It is an a-pointer prime, because the next prime (11031461179) can be obtained adding 11031461153 to its sum of digits (26).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10599320209 + 432140944 = 102953^2 + 20788^2 .
It is a cyclic number.
It is not a de Polignac number, because 11031461153 - 214 = 11031444769 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (11031461113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5515730576 + 5515730577.
It is an arithmetic number, because the mean of its divisors is an integer number (5515730577).
Almost surely, 211031461153 is an apocalyptic number.
It is an amenable number.
11031461153 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031461153 is an equidigital number, since it uses as much as digits as its factorization.
11031461153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 26.
Adding to 11031461153 its reverse (35116413011), we get a palindrome (46147874164).
The spelling of 11031461153 in words is "eleven billion, thirty-one million, four hundred sixty-one thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •