Base | Representation |
---|---|
bin | 10100100011000000… |
… | …11011101111011111 |
3 | 1001110210000121220002 |
4 | 22101200123233133 |
5 | 140042432230101 |
6 | 5022335244515 |
7 | 540235041023 |
oct | 122140335737 |
9 | 31423017802 |
10 | 11031133151 |
11 | 4750872675 |
12 | 217a37973b |
13 | 106a50832c |
14 | 769096383 |
15 | 44868dd6b |
hex | 29181bbdf |
11031133151 has 2 divisors, whose sum is σ = 11031133152. Its totient is φ = 11031133150.
The previous prime is 11031133133. The next prime is 11031133159. The reversal of 11031133151 is 15133113011.
It is a strong prime.
It is an emirp because it is prime and its reverse (15133113011) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11031133151 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11031133159) 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, 5515566575 + 5515566576.
It is an arithmetic number, because the mean of its divisors is an integer number (5515566576).
Almost surely, 211031133151 is an apocalyptic number.
11031133151 is a deficient number, since it is larger than the sum of its proper divisors (1).
11031133151 is an equidigital number, since it uses as much as digits as its factorization.
11031133151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 20.
Adding to 11031133151 its reverse (15133113011), we get a palindrome (26164246162).
The spelling of 11031133151 in words is "eleven billion, thirty-one million, one hundred thirty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •