Search a number
-
+
20150113 = 36595507
BaseRepresentation
bin100110011011…
…1011101100001
31101220201202111
41030313131201
520124300423
61555515321
7333162454
oct114673541
941821674
1020150113
1110413095
1268b8b41
134236859
14296749b
151b8060d
hex1337761

20150113 has 4 divisors (see below), whose sum is σ = 20159280. Its totient is φ = 20140948.

The previous prime is 20150111. The next prime is 20150131. The reversal of 20150113 is 31105102.

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, and also a brilliant number, because the two primes have the same length.

It is a cyclic number.

It is not a de Polignac number, because 20150113 - 21 = 20150111 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (20150111) 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, 906 + ... + 6412.

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

Almost surely, 220150113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 9166.

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

The square root of 20150113 is about 4488.8877241473. The cubic root of 20150113 is about 272.1191852604.

Adding to 20150113 its reverse (31105102), we get a palindrome (51255215).

The spelling of 20150113 in words is "twenty million, one hundred fifty thousand, one hundred thirteen".

Divisors: 1 3659 5507 20150113