Base | Representation |
---|---|
bin | 1100011001111110111… |
… | …0010101101010110101 |
3 | 202101010121120102022211 |
4 | 3012133232111222311 |
5 | 11442444034402404 |
6 | 241524554253421 |
7 | 21253431435046 |
oct | 3063756255265 |
9 | 671117512284 |
10 | 213133122229 |
11 | 82431100325 |
12 | 35381a27271 |
13 | 17138160811 |
14 | a45c3c08cd |
15 | 582641eb04 |
hex | 319fb95ab5 |
213133122229 has 2 divisors, whose sum is σ = 213133122230. Its totient is φ = 213133122228.
The previous prime is 213133122227. The next prime is 213133122239. The reversal of 213133122229 is 922221331312.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109978456900 + 103154665329 = 331630^2 + 321177^2 .
It is a cyclic number.
It is not a de Polignac number, because 213133122229 - 21 = 213133122227 is a prime.
Together with 213133122227, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 213133122229.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (213133122227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106566561114 + 106566561115.
It is an arithmetic number, because the mean of its divisors is an integer number (106566561115).
Almost surely, 2213133122229 is an apocalyptic number.
It is an amenable number.
213133122229 is a deficient number, since it is larger than the sum of its proper divisors (1).
213133122229 is an equidigital number, since it uses as much as digits as its factorization.
213133122229 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7776, while the sum is 31.
The spelling of 213133122229 in words is "two hundred thirteen billion, one hundred thirty-three million, one hundred twenty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •