Search a number
-
+
20011513 = 136714639
BaseRepresentation
bin100110001010…
…1100111111001
31101122200122011
41030111213321
520110332023
61552525521
7332044414
oct114254771
941580564
1020011513
1110328a45
1268508a1
1341b8742
14292cb7b
151b5450d
hex13159f9

20011513 has 4 divisors (see below), whose sum is σ = 20027520. Its totient is φ = 19995508.

The previous prime is 20011507. The next prime is 20011529. The reversal of 20011513 is 31511002.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 20011513 - 29 = 20011001 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (20011543) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5953 + ... + 8686.

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

Almost surely, 220011513 is an apocalyptic number.

It is an amenable number.

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

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

20011513 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 16006.

The product of its (nonzero) digits is 30, while the sum is 13.

The square root of 20011513 is about 4473.4229623410. The cubic root of 20011513 is about 271.4938368184.

Adding to 20011513 its reverse (31511002), we get a palindrome (51522515).

The spelling of 20011513 in words is "twenty million, eleven thousand, five hundred thirteen".

Divisors: 1 1367 14639 20011513