103214013 has 32 divisors (see below), whose sum is σ = 161061120. Its totient is φ = 57576960.

The previous prime is 103214011. The next prime is 103214029. The reversal of 103214013 is 310412301.

It is not a de Polignac number, because 103214013 - 2¹ = 103214011 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (103214011) 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 31 ways as a sum of consecutive naturals, for example, 252153 + ... + 252561.

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

Almost surely, 2^103214013 is an apocalyptic number.

It is an amenable number.

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

103214013 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 677.

The product of its (nonzero) digits is 72, while the sum is 15.

The square root of 103214013 is about 10159.4297576193. The cubic root of 103214013 is about 469.0792491441.

Adding to 103214013 its reverse (310412301), we get a palindrome (413626314).

The spelling of 103214013 in words is "one hundred three million, two hundred fourteen thousand, thirteen".