Base | Representation |
---|---|
bin | 100000001011011101000… |
… | …100011111101001101101 |
3 | 21211101210211201111020111 |
4 | 200023131010133221231 |
5 | 242212241431224401 |
6 | 4411511203420021 |
7 | 315522423666334 |
oct | 40133504375155 |
9 | 7741724644214 |
10 | 2211322133101 |
11 | 7828a8771184 |
12 | 2b869b384611 |
13 | 1306b0457c93 |
14 | 79058536d1b |
15 | 3c7c5422e51 |
hex | 202dd11fa6d |
2211322133101 has 2 divisors, whose sum is σ = 2211322133102. Its totient is φ = 2211322133100.
The previous prime is 2211322133051. The next prime is 2211322133131. The reversal of 2211322133101 is 1013312231122.
2211322133101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1486143855625 + 725178277476 = 1219075^2 + 851574^2 .
It is a cyclic number.
It is not a de Polignac number, because 2211322133101 - 215 = 2211322100333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2211322133131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1105661066550 + 1105661066551.
It is an arithmetic number, because the mean of its divisors is an integer number (1105661066551).
Almost surely, 22211322133101 is an apocalyptic number.
It is an amenable number.
2211322133101 is a deficient number, since it is larger than the sum of its proper divisors (1).
2211322133101 is an equidigital number, since it uses as much as digits as its factorization.
2211322133101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 2211322133101 its reverse (1013312231122), we get a palindrome (3224634364223).
The spelling of 2211322133101 in words is "two trillion, two hundred eleven billion, three hundred twenty-two million, one hundred thirty-three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •