Base | Representation |
---|---|
bin | 110000011101001011001100… |
… | …001100100100100001001101 |
3 | 1000221120020000220002221122112 |
4 | 300131023030030210201031 |
5 | 210413103024430442201 |
6 | 2033125521022153405 |
7 | 62613525023231525 |
oct | 6035131414444115 |
9 | 1027506026087575 |
10 | 213111113140301 |
11 | 619a3a08632a12 |
12 | 1ba9a440722865 |
13 | 91bb3a3c45b9c |
14 | 3a8a8c09cc685 |
15 | 19987983ed0bb |
hex | c1d2cc32484d |
213111113140301 has 2 divisors, whose sum is σ = 213111113140302. Its totient is φ = 213111113140300.
The previous prime is 213111113140183. The next prime is 213111113140327. The reversal of 213111113140301 is 103041311111312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 190158859836100 + 22952253304201 = 13789810^2 + 4790851^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-213111113140301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213111113140381) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106555556570150 + 106555556570151.
It is an arithmetic number, because the mean of its divisors is an integer number (106555556570151).
Almost surely, 2213111113140301 is an apocalyptic number.
It is an amenable number.
213111113140301 is a deficient number, since it is larger than the sum of its proper divisors (1).
213111113140301 is an equidigital number, since it uses as much as digits as its factorization.
213111113140301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 23.
Adding to 213111113140301 its reverse (103041311111312), we get a palindrome (316152424251613).
The spelling of 213111113140301 in words is "two hundred thirteen trillion, one hundred eleven billion, one hundred thirteen million, one hundred forty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •