Base | Representation |
---|---|
bin | 1010000001011101000111… |
… | …0100000110101011110011 |
3 | 1110000111211111110001201101 |
4 | 2200113101310012223303 |
5 | 2421023141432230001 |
6 | 35234322540345231 |
7 | 2215114425515302 |
oct | 240272164065363 |
9 | 43014744401641 |
10 | 11020111211251 |
11 | 356966a53765a |
12 | 129b930b45217 |
13 | 61c265b6945c |
14 | 2a153a52a439 |
15 | 1419d2091a01 |
hex | a05d1d06af3 |
11020111211251 has 2 divisors, whose sum is σ = 11020111211252. Its totient is φ = 11020111211250.
The previous prime is 11020111211243. The next prime is 11020111211383. The reversal of 11020111211251 is 15211211102011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 11020111211251 - 23 = 11020111211243 is a prime.
It is a super-2 number, since 2×110201112112512 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11020111211951) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510055605625 + 5510055605626.
It is an arithmetic number, because the mean of its divisors is an integer number (5510055605626).
Almost surely, 211020111211251 is an apocalyptic number.
11020111211251 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020111211251 is an equidigital number, since it uses as much as digits as its factorization.
11020111211251 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 19.
Adding to 11020111211251 its reverse (15211211102011), we get a palindrome (26231322313262).
The spelling of 11020111211251 in words is "eleven trillion, twenty billion, one hundred eleven million, two hundred eleven thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •