1020351413 has 4 divisors (see below), whose sum is σ = 1023379500. Its totient is φ = 1017323328.

The previous prime is 1020351349. The next prime is 1020351419. The reversal of 1020351413 is 3141530201.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3141530201 = 1031 ⋅3047071.

It can be written as a sum of positive squares in 2 ways, for example, as 357134404 + 663217009 = 18898^2 + 25753^2 .

It is a cyclic number.

It is not a de Polignac number, because 1020351413 - 2⁶ = 1020351349 is a prime.

It is a super-2 number, since 2×1020351413² = 2082234012022193138, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (1020351419) 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 in 3 ways as a sum of consecutive naturals, for example, 1513538 + ... + 1514211.

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

Almost surely, 2^1020351413 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 3028086.

The product of its (nonzero) digits is 360, while the sum is 20.

The square root of 1020351413 is about 31942.9399554894. The cubic root of 1020351413 is about 1006.7382976942.

Adding to 1020351413 its reverse (3141530201), we get a palindrome (4161881614).

It can be divided in two parts, 10203 and 51413, that added together give a palindrome (61616).

The spelling of 1020351413 in words is "one billion, twenty million, three hundred fifty-one thousand, four hundred thirteen".