Base | Representation |
---|---|
bin | 1100010101101… |
… | …11110001111101 |
3 | 21012210000102201 |
4 | 12022313301331 |
5 | 202444410323 |
6 | 14134351501 |
7 | 2364563536 |
oct | 612676175 |
9 | 235700381 |
10 | 103513213 |
11 | 53481011 |
12 | 2a7bb591 |
13 | 185a392b |
14 | da6768d |
15 | 914a8ad |
hex | 62b7c7d |
103513213 has 2 divisors, whose sum is σ = 103513214. Its totient is φ = 103513212.
The previous prime is 103513211. The next prime is 103513217. The reversal of 103513213 is 312315301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99261369 + 4251844 = 9963^2 + 2062^2 .
It is an emirp because it is prime and its reverse (312315301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103513213 - 21 = 103513211 is a prime.
Together with 103513211, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103513211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51756606 + 51756607.
It is an arithmetic number, because the mean of its divisors is an integer number (51756607).
Almost surely, 2103513213 is an apocalyptic number.
It is an amenable number.
103513213 is a deficient number, since it is larger than the sum of its proper divisors (1).
103513213 is an equidigital number, since it uses as much as digits as its factorization.
103513213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 270, while the sum is 19.
The square root of 103513213 is about 10174.1443374861. The cubic root of 103513213 is about 469.5320723920.
Adding to 103513213 its reverse (312315301), we get a palindrome (415828514).
The spelling of 103513213 in words is "one hundred three million, five hundred thirteen thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •