Base | Representation |
---|---|
bin | 1010000011001101000010… |
… | …0010001101011101001011 |
3 | 1110010101101021012222122022 |
4 | 2200303100202031131023 |
5 | 2422021204023424001 |
6 | 35300212040515055 |
7 | 2220230062420046 |
oct | 240632042153513 |
9 | 43111337188568 |
10 | 11050154514251 |
11 | 3580387167896 |
12 | 12a571647ba8b |
13 | 6220431b3618 |
14 | 2a2b8a607c5d |
15 | 14268e8c111b |
hex | a0cd088d74b |
11050154514251 has 2 divisors, whose sum is σ = 11050154514252. Its totient is φ = 11050154514250.
The previous prime is 11050154514247. The next prime is 11050154514257. The reversal of 11050154514251 is 15241545105011.
It is a weak prime.
It is an emirp because it is prime and its reverse (15241545105011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11050154514251 - 22 = 11050154514247 is a prime.
It is not a weakly prime, because it can be changed into another prime (11050154514257) 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, 5525077257125 + 5525077257126.
It is an arithmetic number, because the mean of its divisors is an integer number (5525077257126).
Almost surely, 211050154514251 is an apocalyptic number.
11050154514251 is a deficient number, since it is larger than the sum of its proper divisors (1).
11050154514251 is an equidigital number, since it uses as much as digits as its factorization.
11050154514251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20000, while the sum is 35.
Adding to 11050154514251 its reverse (15241545105011), we get a palindrome (26291699619262).
The spelling of 11050154514251 in words is "eleven trillion, fifty billion, one hundred fifty-four million, five hundred fourteen thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •