Base | Representation |
---|---|
bin | 110000011101011101111011… |
… | …011100001000110011111101 |
3 | 1000221122010222002100221220221 |
4 | 300131131323130020303331 |
5 | 210413420231133244401 |
6 | 2033143045314541341 |
7 | 62615136433133305 |
oct | 6035357334106375 |
9 | 1027563862327827 |
10 | 213131233103101 |
11 | 61a014a2848845 |
12 | 1baa2316897851 |
13 | 91c025c433811 |
14 | 3a8b86cbc0605 |
15 | 19990749637a1 |
hex | c1d77b708cfd |
213131233103101 has 2 divisors, whose sum is σ = 213131233103102. Its totient is φ = 213131233103100.
The previous prime is 213131233103083. The next prime is 213131233103263. The reversal of 213131233103101 is 101301332131312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 180887301819225 + 32243931283876 = 13449435^2 + 5678374^2 .
It is a cyclic number.
It is not a de Polignac number, because 213131233103101 - 25 = 213131233103069 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213131233103401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106565616551550 + 106565616551551.
It is an arithmetic number, because the mean of its divisors is an integer number (106565616551551).
Almost surely, 2213131233103101 is an apocalyptic number.
It is an amenable number.
213131233103101 is a deficient number, since it is larger than the sum of its proper divisors (1).
213131233103101 is an equidigital number, since it uses as much as digits as its factorization.
213131233103101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 25.
Adding to 213131233103101 its reverse (101301332131312), we get a palindrome (314432565234413).
The spelling of 213131233103101 in words is "two hundred thirteen trillion, one hundred thirty-one billion, two hundred thirty-three million, one hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •