Base | Representation |
---|---|
bin | 110000000011111011… |
… | …1100001010111100101 |
3 | 100212101222002201112022 |
4 | 1200013313201113211 |
5 | 3142334032211323 |
6 | 115225314232525 |
7 | 10312445545256 |
oct | 1400767412745 |
9 | 325358081468 |
10 | 103211210213 |
11 | 3a854045941 |
12 | 18005285745 |
13 | 996aba4927 |
14 | 4dd1726b2d |
15 | 2a410ee4c8 |
hex | 1807de15e5 |
103211210213 has 2 divisors, whose sum is σ = 103211210214. Its totient is φ = 103211210212.
The previous prime is 103211210177. The next prime is 103211210239. The reversal of 103211210213 is 312012112301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 103209915169 + 1295044 = 321263^2 + 1138^2 .
It is a cyclic number.
It is not a de Polignac number, because 103211210213 - 214 = 103211193829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103211210191 and 103211210200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103211210813) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51605605106 + 51605605107.
It is an arithmetic number, because the mean of its divisors is an integer number (51605605107).
Almost surely, 2103211210213 is an apocalyptic number.
It is an amenable number.
103211210213 is a deficient number, since it is larger than the sum of its proper divisors (1).
103211210213 is an equidigital number, since it uses as much as digits as its factorization.
103211210213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 103211210213 its reverse (312012112301), we get a palindrome (415223322514).
The spelling of 103211210213 in words is "one hundred three billion, two hundred eleven million, two hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •