Search a number
-
+
15150101313 = 321067239713
BaseRepresentation
bin11100001110000010…
…00011001101000001
31110002211120212222110
432013001003031001
5222011411220223
610543155125533
71044301510404
oct160701031501
943084525873
1015150101313
116474923396
122b298a38a9
1315759820b9
14a3a137d3b
155da0b3d93
hex387043341

15150101313 has 8 divisors (see below), whose sum is σ = 20201178208. Its totient is φ = 10099545984.

The previous prime is 15150101279. The next prime is 15150101321. The reversal of 15150101313 is 31310105151.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 15150101313 - 218 = 15149839169 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 15150101313.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56656 + ... + 183057.

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

Almost surely, 215150101313 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 260783.

The product of its (nonzero) digits is 225, while the sum is 21.

Adding to 15150101313 its reverse (31310105151), we get a palindrome (46460206464).

The spelling of 15150101313 in words is "fifteen billion, one hundred fifty million, one hundred one thousand, three hundred thirteen".

Divisors: 1 3 21067 63201 239713 719139 5050033771 15150101313