Base | Representation |
---|---|
bin | 1001001011111101001100… |
… | …1011011101110100110101 |
3 | 1022202122110211110100220211 |
4 | 2102333103023131310311 |
5 | 2310443332321024341 |
6 | 33252201311425421 |
7 | 2061526320542032 |
oct | 222772313356465 |
9 | 38678424410824 |
10 | 10101011111221 |
11 | 32448a6491a28 |
12 | 1171788225271 |
13 | 5836a1295714 |
14 | 26cc6a590389 |
15 | 127b3cd06181 |
hex | 92fd32ddd35 |
10101011111221 has 2 divisors, whose sum is σ = 10101011111222. Its totient is φ = 10101011111220.
The previous prime is 10101011111201. The next prime is 10101011111227. The reversal of 10101011111221 is 12211111010101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7789513540900 + 2311497570321 = 2790970^2 + 1520361^2 .
It is a cyclic number.
It is not a de Polignac number, because 10101011111221 - 229 = 10100474240309 is a prime.
It is a super-2 number, since 2×101010111112212 (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 (10101011111227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5050505555610 + 5050505555611.
It is an arithmetic number, because the mean of its divisors is an integer number (5050505555611).
Almost surely, 210101011111221 is an apocalyptic number.
It is an amenable number.
10101011111221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10101011111221 is an equidigital number, since it uses as much as digits as its factorization.
10101011111221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 10101011111221 its reverse (12211111010101), we get a palindrome (22312122121322).
The spelling of 10101011111221 in words is "ten trillion, one hundred one billion, eleven million, one hundred eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •