Base | Representation |
---|---|
bin | 1010010000000011100110… |
… | …1000011100111010100011 |
3 | 1110220111022122202020121011 |
4 | 2210000321220130322203 |
5 | 2434130412014341321 |
6 | 35545450312041351 |
7 | 2242204631353264 |
oct | 244007150347243 |
9 | 43814278666534 |
10 | 11270961090211 |
11 | 3655a9577a509 |
12 | 132047a093257 |
13 | 639b020234b4 |
14 | 2ad735b6c96b |
15 | 1482b47d6ae1 |
hex | a4039a1cea3 |
11270961090211 has 2 divisors, whose sum is σ = 11270961090212. Its totient is φ = 11270961090210.
The previous prime is 11270961090149. The next prime is 11270961090223. The reversal of 11270961090211 is 11209016907211.
It is a strong prime.
It is an emirp because it is prime and its reverse (11209016907211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11270961090211 - 225 = 11270927535779 is a prime.
It is not a weakly prime, because it can be changed into another prime (11270961097211) 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, 5635480545105 + 5635480545106.
It is an arithmetic number, because the mean of its divisors is an integer number (5635480545106).
Almost surely, 211270961090211 is an apocalyptic number.
11270961090211 is a deficient number, since it is larger than the sum of its proper divisors (1).
11270961090211 is an equidigital number, since it uses as much as digits as its factorization.
11270961090211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13608, while the sum is 40.
Adding to 11270961090211 its reverse (11209016907211), we get a palindrome (22479977997422).
The spelling of 11270961090211 in words is "eleven trillion, two hundred seventy billion, nine hundred sixty-one million, ninety thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •