Base | Representation |
---|---|
bin | 1010001101001010010101… |
… | …1100010001101001010101 |
3 | 1110201201221211100210111101 |
4 | 2203102211130101221111 |
5 | 2432322034414330401 |
6 | 35510543443110101 |
7 | 2235464355130033 |
oct | 243224534215125 |
9 | 43651854323441 |
10 | 11221230230101 |
11 | 3636995a23221 |
12 | 13128bb372331 |
13 | 635207c67c58 |
14 | 2ab17909b553 |
15 | 146d538a7101 |
hex | a34a5711a55 |
11221230230101 has 2 divisors, whose sum is σ = 11221230230102. Its totient is φ = 11221230230100.
The previous prime is 11221230230071. The next prime is 11221230230113. The reversal of 11221230230101 is 10103203212211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11220188619025 + 1041611076 = 3349655^2 + 32274^2 .
It is an emirp because it is prime and its reverse (10103203212211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11221230230101 - 221 = 11221228132949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11221230230201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5610615115050 + 5610615115051.
It is an arithmetic number, because the mean of its divisors is an integer number (5610615115051).
Almost surely, 211221230230101 is an apocalyptic number.
It is an amenable number.
11221230230101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11221230230101 is an equidigital number, since it uses as much as digits as its factorization.
11221230230101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11221230230101 its reverse (10103203212211), we get a palindrome (21324433442312).
The spelling of 11221230230101 in words is "eleven trillion, two hundred twenty-one billion, two hundred thirty million, two hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •