Search a number
-
+
15150356513 = 71213385303
BaseRepresentation
bin11100001110000100…
…00001100000100001
31110002212001212001022
432013002001200201
5222011442402023
610543204415225
71044303622415
oct160702014041
943085055038
1015150356513
116474a880a6
122b299a7515
131575a412c6
14a3a1a2d45
155da1147c8
hex387081821

15150356513 has 4 divisors (see below), whose sum is σ = 15363741888. Its totient is φ = 14936971140.

The previous prime is 15150356503. The next prime is 15150356567. The reversal of 15150356513 is 31565305151.

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 an emirpimes, since its reverse is a distinct semiprime: 31565305151 = 116327141277.

It is a cyclic number.

It is not a de Polignac number, because 15150356513 - 28 = 15150356257 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 215150356513 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 213385374.

The product of its (nonzero) digits is 33750, while the sum is 35.

The spelling of 15150356513 in words is "fifteen billion, one hundred fifty million, three hundred fifty-six thousand, five hundred thirteen".

Divisors: 1 71 213385303 15150356513