Base | Representation |
---|---|
bin | 10110110010011010010001… |
… | …101100010100101000000001 |
3 | 111010212001110112012211002011 |
4 | 112302122101230110220001 |
5 | 101114011020031400001 |
6 | 553052553330252521 |
7 | 30052513020256423 |
oct | 2662322154245001 |
9 | 433761415184064 |
10 | 100221211200001 |
11 | 29a2a638a62931 |
12 | b2a7660a27141 |
13 | 43bca86a56028 |
14 | 1aa6a37dc2813 |
15 | b8beb4eadd51 |
hex | 5b2691b14a01 |
100221211200001 has 2 divisors, whose sum is σ = 100221211200002. Its totient is φ = 100221211200000.
The previous prime is 100221211199981. The next prime is 100221211200013. The reversal of 100221211200001 is 100002112122001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 98127865214401 + 2093345985600 = 9905951^2 + 1446840^2 .
It is a cyclic number.
It is not a de Polignac number, because 100221211200001 - 211 = 100221211197953 is a prime.
It is not a weakly prime, because it can be changed into another prime (100221211200401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50110605600000 + 50110605600001.
It is an arithmetic number, because the mean of its divisors is an integer number (50110605600001).
Almost surely, 2100221211200001 is an apocalyptic number.
It is an amenable number.
100221211200001 is a deficient number, since it is larger than the sum of its proper divisors (1).
100221211200001 is an equidigital number, since it uses as much as digits as its factorization.
100221211200001 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 13.
Adding to 100221211200001 its reverse (100002112122001), we get a palindrome (200223323322002).
The spelling of 100221211200001 in words is "one hundred trillion, two hundred twenty-one billion, two hundred eleven million, two hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •