Search a number
-
+
2013151015 = 523131133631
BaseRepresentation
bin111011111111110…
…0011111100100111
312012022002200000201
41313333203330213
513110331313030
6531432451331
7100613333641
oct16777437447
95168080021
102013151015
1194340a177
12482249b47
13261100225
1415151d891
15bbb0e2ca
hex77fe3f27

2013151015 has 16 divisors (see below), whose sum is σ = 2540077056. Its totient is φ = 1528727200.

The previous prime is 2013151013. The next prime is 2013151031. The reversal of 2013151015 is 5101513102.

It is not a de Polignac number, because 2013151015 - 21 = 2013151013 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51751 + ... + 81880.

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

Almost surely, 22013151015 is an apocalyptic number.

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

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

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

The sum of its prime factors is 133790.

The product of its (nonzero) digits is 150, while the sum is 19.

The square root of 2013151015 is about 44868.1514551246. The cubic root of 2013151015 is about 1262.6765591716.

Adding to 2013151015 its reverse (5101513102), we get a palindrome (7114664117).

The spelling of 2013151015 in words is "two billion, thirteen million, one hundred fifty-one thousand, fifteen".

Divisors: 1 5 23 115 131 655 3013 15065 133631 668155 3073513 15367565 17505661 87528305 402630203 2013151015