Base | Representation |
---|---|
bin | 100111000011100… |
… | …1111011101111101 |
3 | 10101022222101010201 |
4 | 1032013033131331 |
5 | 10140443134323 |
6 | 334013003501 |
7 | 44322150361 |
oct | 11607173575 |
9 | 3338871121 |
10 | 1310521213 |
11 | 612833a91 |
12 | 306a83591 |
13 | 17b67cb51 |
14 | c609d2a1 |
15 | 7a0bc8ad |
hex | 4e1cf77d |
1310521213 has 2 divisors, whose sum is σ = 1310521214. Its totient is φ = 1310521212.
The previous prime is 1310521207. The next prime is 1310521231. The reversal of 1310521213 is 3121250131.
Together with next prime (1310521231) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 907395129 + 403126084 = 30123^2 + 20078^2 .
It is an emirp because it is prime and its reverse (3121250131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1310521213 - 229 = 773650301 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1310521813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655260606 + 655260607.
It is an arithmetic number, because the mean of its divisors is an integer number (655260607).
Almost surely, 21310521213 is an apocalyptic number.
It is an amenable number.
1310521213 is a deficient number, since it is larger than the sum of its proper divisors (1).
1310521213 is an equidigital number, since it uses as much as digits as its factorization.
1310521213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 180, while the sum is 19.
The square root of 1310521213 is about 36201.1217091405. The cubic root of 1310521213 is about 1094.3292773942.
Adding to 1310521213 its reverse (3121250131), we get a palindrome (4431771344).
The spelling of 1310521213 in words is "one billion, three hundred ten million, five hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •