Base | Representation |
---|---|
bin | 1100011001111001110… |
… | …1111000101101100101 |
3 | 202101002010212221002222 |
4 | 3012132131320231211 |
5 | 11442423140011401 |
6 | 241522522242125 |
7 | 21253054245563 |
oct | 3063635705545 |
9 | 671063787088 |
10 | 213112032101 |
11 | 82420205a71 |
12 | 35376956345 |
13 | 17133988157 |
14 | a459690a33 |
15 | 5824655c1b |
hex | 319e778b65 |
213112032101 has 2 divisors, whose sum is σ = 213112032102. Its totient is φ = 213112032100.
The previous prime is 213112032097. The next prime is 213112032137. The reversal of 213112032101 is 101230211312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 161303443876 + 51808588225 = 401626^2 + 227615^2 .
It is a cyclic number.
It is not a de Polignac number, because 213112032101 - 22 = 213112032097 is a prime.
It is a super-4 number, since 4×2131120321014 (a number of 46 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 213112032101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213112032191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106556016050 + 106556016051.
It is an arithmetic number, because the mean of its divisors is an integer number (106556016051).
Almost surely, 2213112032101 is an apocalyptic number.
It is an amenable number.
213112032101 is a deficient number, since it is larger than the sum of its proper divisors (1).
213112032101 is an equidigital number, since it uses as much as digits as its factorization.
213112032101 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 213112032101 its reverse (101230211312), we get a palindrome (314342243413).
The spelling of 213112032101 in words is "two hundred thirteen billion, one hundred twelve million, thirty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •