Base | Representation |
---|---|
bin | 1010001101000110100000… |
… | …0110000111010000000101 |
3 | 1110201122022002201000012002 |
4 | 2203101220012013100011 |
5 | 2432312432424311211 |
6 | 35510253355235045 |
7 | 2235430016656622 |
oct | 243215006072005 |
9 | 43648262630162 |
10 | 11220201010181 |
11 | 3636507a62049 |
12 | 1312672748a85 |
13 | 6350a2969b97 |
14 | 2ab0bc505349 |
15 | 146ce335303b |
hex | a3468187405 |
11220201010181 has 2 divisors, whose sum is σ = 11220201010182. Its totient is φ = 11220201010180.
The previous prime is 11220201010177. The next prime is 11220201010217. The reversal of 11220201010181 is 18101010202211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10991936837281 + 228264172900 = 3315409^2 + 477770^2 .
It is a cyclic number.
It is not a de Polignac number, because 11220201010181 - 22 = 11220201010177 is a prime.
It is a super-2 number, since 2×112202010101812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11220201013181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610100505090 + 5610100505091.
It is an arithmetic number, because the mean of its divisors is an integer number (5610100505091).
Almost surely, 211220201010181 is an apocalyptic number.
It is an amenable number.
11220201010181 is a deficient number, since it is larger than the sum of its proper divisors (1).
11220201010181 is an equidigital number, since it uses as much as digits as its factorization.
11220201010181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 20.
Adding to 11220201010181 its reverse (18101010202211), we get a palindrome (29321211212392).
The spelling of 11220201010181 in words is "eleven trillion, two hundred twenty billion, two hundred one million, ten thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •