Base | Representation |
---|---|
bin | 110000011101100000100001… |
… | …000101101000011110010011 |
3 | 1000221122102010202202210102202 |
4 | 300131200201011220132103 |
5 | 210413441424112040311 |
6 | 2033144225153033415 |
7 | 62615265340220645 |
oct | 6035404105503623 |
9 | 1027572122683382 |
10 | 213134012221331 |
11 | 61a02699563473 |
12 | 1baa297155586b |
13 | 91c05b312c186 |
14 | 3a8ba53d2a895 |
15 | 1999188925e3b |
hex | c1d821168793 |
213134012221331 has 2 divisors, whose sum is σ = 213134012221332. Its totient is φ = 213134012221330.
The previous prime is 213134012221279. The next prime is 213134012221337. The reversal of 213134012221331 is 133122210431312.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 213134012221331 - 210 = 213134012220307 is a prime.
It is a super-2 number, since 2×2131340122213312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 213134012221294 and 213134012221303.
It is not a weakly prime, because it can be changed into another prime (213134012221337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106567006110665 + 106567006110666.
It is an arithmetic number, because the mean of its divisors is an integer number (106567006110666).
Almost surely, 2213134012221331 is an apocalyptic number.
213134012221331 is a deficient number, since it is larger than the sum of its proper divisors (1).
213134012221331 is an equidigital number, since it uses as much as digits as its factorization.
213134012221331 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5184, while the sum is 29.
Adding to 213134012221331 its reverse (133122210431312), we get a palindrome (346256222652643).
The spelling of 213134012221331 in words is "two hundred thirteen trillion, one hundred thirty-four billion, twelve million, two hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •