Base | Representation |
---|---|
bin | 1001010010011111001101… |
… | …1111101110101111110101 |
3 | 1100011101010000212200121201 |
4 | 2110213303133232233311 |
5 | 2314313134421202041 |
6 | 33415520054012501 |
7 | 2102611113251632 |
oct | 224476337565765 |
9 | 40141100780551 |
10 | 10213222444021 |
11 | 32884488a2103 |
12 | 118b483647131 |
13 | 59114496136c |
14 | 274473321189 |
15 | 12aa09108631 |
hex | 949f37eebf5 |
10213222444021 has 2 divisors, whose sum is σ = 10213222444022. Its totient is φ = 10213222444020.
The previous prime is 10213222444001. The next prime is 10213222444067. The reversal of 10213222444021 is 12044422231201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8594360644996 + 1618861799025 = 2931614^2 + 1272345^2 .
It is a cyclic number.
It is not a de Polignac number, because 10213222444021 - 29 = 10213222443509 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10213222444001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106611222010 + 5106611222011.
It is an arithmetic number, because the mean of its divisors is an integer number (5106611222011).
Almost surely, 210213222444021 is an apocalyptic number.
It is an amenable number.
10213222444021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10213222444021 is an equidigital number, since it uses as much as digits as its factorization.
10213222444021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6144, while the sum is 28.
Adding to 10213222444021 its reverse (12044422231201), we get a palindrome (22257644675222).
The spelling of 10213222444021 in words is "ten trillion, two hundred thirteen billion, two hundred twenty-two million, four hundred forty-four thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •