Base | Representation |
---|---|
bin | 1100011001100110110… |
… | …1000011001100001101 |
3 | 202100212120112000211022 |
4 | 3012121231003030031 |
5 | 11442242210333401 |
6 | 241510545403525 |
7 | 21251064103112 |
oct | 3063155031415 |
9 | 670776460738 |
10 | 213032121101 |
11 | 8238a095718 |
12 | 353540395a5 |
13 | 17120259437 |
14 | a44cc0c909 |
15 | 581c61d71b |
hex | 3199b4330d |
213032121101 has 2 divisors, whose sum is σ = 213032121102. Its totient is φ = 213032121100.
The previous prime is 213032121091. The next prime is 213032121109. The reversal of 213032121101 is 101121230312.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 108379224100 + 104652897001 = 329210^2 + 323501^2 .
It is a cyclic number.
It is not a de Polignac number, because 213032121101 - 26 = 213032121037 is a prime.
It is a super-2 number, since 2×2130321211012 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 213032121101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213032121109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106516060550 + 106516060551.
It is an arithmetic number, because the mean of its divisors is an integer number (106516060551).
Almost surely, 2213032121101 is an apocalyptic number.
It is an amenable number.
213032121101 is a deficient number, since it is larger than the sum of its proper divisors (1).
213032121101 is an equidigital number, since it uses as much as digits as its factorization.
213032121101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 213032121101 its reverse (101121230312), we get a palindrome (314153351413).
The spelling of 213032121101 in words is "two hundred thirteen billion, thirty-two million, one hundred twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •