Search a number
-
+
15000000051 = 35984745763
BaseRepresentation
bin11011111100001000…
…11101011000110011
31102201101010221202110
431332010131120303
5221210000000201
610520234020403
71040466616401
oct157604353063
942641127673
1015000000051
1163a8122063
122aa7577703
13155084909a
14a24224471
155cbd146d6
hex37e11d633

15000000051 has 8 divisors (see below), whose sum is σ = 20338983360. Its totient is φ = 9830508392.

The previous prime is 15000000047. The next prime is 15000000077.

15000000051 is nontrivially palindromic in base 10.

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

It is a cyclic number.

It is not a de Polignac number, because 15000000051 - 22 = 15000000047 is a prime.

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

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

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

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

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

Almost surely, 215000000051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 84745825.

The product of its (nonzero) digits is 25, while the sum is 12.

It can be divided in two parts, 150000000 and 51, that added together give a palindrome (150000051).

The spelling of 15000000051 in words is "fifteen billion, fifty-one", and thus it is an aban number and an uban number.

Divisors: 1 3 59 177 84745763 254237289 5000000017 15000000051