Base | Representation |
---|---|
bin | 1010000110001110100010… |
… | …1111010111000010110011 |
3 | 1110022100110110020100200222 |
4 | 2201203220233113002303 |
5 | 2423344100124102011 |
6 | 35340122345403255 |
7 | 2224046251562402 |
oct | 241435057270263 |
9 | 43270413210628 |
10 | 11102100222131 |
11 | 35a0413164a86 |
12 | 12b37b2a9952b |
13 | 626c0109b789 |
14 | 2a54b74dd639 |
15 | 143bceea1ddb |
hex | a18e8bd70b3 |
11102100222131 has 2 divisors, whose sum is σ = 11102100222132. Its totient is φ = 11102100222130.
The previous prime is 11102100222071. The next prime is 11102100222277. The reversal of 11102100222131 is 13122200120111.
It is a happy number.
11102100222131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11102100222131 is a prime.
It is a super-2 number, since 2×111021002221312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11102100222931) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5551050111065 + 5551050111066.
It is an arithmetic number, because the mean of its divisors is an integer number (5551050111066).
Almost surely, 211102100222131 is an apocalyptic number.
11102100222131 is a deficient number, since it is larger than the sum of its proper divisors (1).
11102100222131 is an equidigital number, since it uses as much as digits as its factorization.
11102100222131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 11102100222131 its reverse (13122200120111), we get a palindrome (24224300342242).
The spelling of 11102100222131 in words is "eleven trillion, one hundred two billion, one hundred million, two hundred twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •