Search a number
-
+
15045010131 = 35015003377
BaseRepresentation
bin11100000001100000…
…01010001011010011
31102211111211200222110
432000300022023103
5221303010311011
610524522440403
71041554322204
oct160060121323
942744750873
1015045010131
116420574878
122aba663103
131559c78178
14a2a1bd5ab
155d0c55ba6
hex380c0a2d3

15045010131 has 4 divisors (see below), whose sum is σ = 20060013512. Its totient is φ = 10030006752.

The previous prime is 15045010129. The next prime is 15045010159. The reversal of 15045010131 is 13101054051.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is not a de Polignac number, because 15045010131 - 21 = 15045010129 is a prime.

It is a super-2 number, since 2×150450101312 (a number of 21 digits) contains 22 as substring.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (15045010181) 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 3 ways as a sum of consecutive naturals, for example, 2507501686 + ... + 2507501691.

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

Almost surely, 215045010131 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5015003380.

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

Adding to 15045010131 its reverse (13101054051), we get a palindrome (28146064182).

The spelling of 15045010131 in words is "fifteen billion, forty-five million, ten thousand, one hundred thirty-one".

Divisors: 1 3 5015003377 15045010131