1015211213 has 2 divisors, whose sum is σ = 1015211214. Its totient is φ = 1015211212.

The previous prime is 1015211201. The next prime is 1015211221. The reversal of 1015211213 is 3121125101.

1015211213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 530242729 + 484968484 = 23027^2 + 22022^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2^k-1015211213 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 1015211191 and 1015211200.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (1015211293) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 507605606 + 507605607.

It is an arithmetic number, because the mean of its divisors is an integer number (507605607).

Almost surely, 2^1015211213 is an apocalyptic number.

It is an amenable number.

1015211213 is a deficient number, since it is larger than the sum of its proper divisors (1).

1015211213 is an equidigital number, since it uses as much as digits as its factorization.

1015211213 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 60, while the sum is 17.

The square root of 1015211213 is about 31862.3792739965. The cubic root of 1015211213 is about 1005.0449104127.

Adding to 1015211213 its reverse (3121125101), we get a palindrome (4136336314).

The spelling of 1015211213 in words is "one billion, fifteen million, two hundred eleven thousand, two hundred thirteen".