Base | Representation |
---|---|
bin | 1100111000000101000… |
… | …1001110110100010101 |
3 | 210010222122121112012212 |
4 | 3032001101032310111 |
5 | 12111020300010401 |
6 | 245342355123205 |
7 | 21660561624413 |
oct | 3160121166425 |
9 | 703878545185 |
10 | 221212110101 |
11 | 858a7518504 |
12 | 36a575a3505 |
13 | 17b24b6b408 |
14 | a9c736a2b3 |
15 | 5b4a81ddbb |
hex | 338144ed15 |
221212110101 has 2 divisors, whose sum is σ = 221212110102. Its totient is φ = 221212110100.
The previous prime is 221212110083. The next prime is 221212110121. The reversal of 221212110101 is 101011212122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 205730280625 + 15481829476 = 453575^2 + 124426^2 .
It is a cyclic number.
It is not a de Polignac number, because 221212110101 - 234 = 204032240917 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221212110121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110606055050 + 110606055051.
It is an arithmetic number, because the mean of its divisors is an integer number (110606055051).
Almost surely, 2221212110101 is an apocalyptic number.
It is an amenable number.
221212110101 is a deficient number, since it is larger than the sum of its proper divisors (1).
221212110101 is an equidigital number, since it uses as much as digits as its factorization.
221212110101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 221212110101 its reverse (101011212122), we get a palindrome (322223322223).
It can be divided in two parts, 2212121 and 10101, that added together give a palindrome (2222222).
The spelling of 221212110101 in words is "two hundred twenty-one billion, two hundred twelve million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •