Search a number
-
+
15015211039 = 139435724793
BaseRepresentation
bin11011111101111100…
…11111000000011111
31102202102202202022101
431332332133000133
5221222343223124
610521540025531
71041043121323
oct157676370037
942672682271
1015015211039
116405771324
122ab06922a7
131553a4377a
14a26263983
155cd31b644
hex37ef9f01f

15015211039 has 8 divisors (see below), whose sum is σ = 15127315280. Its totient is φ = 14903165376.

The previous prime is 15015211037. The next prime is 15015211051. The reversal of 15015211039 is 93011251051.

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 15015211039 - 21 = 15015211037 is a prime.

It is a Duffinian number.

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

It is a congruent number.

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

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

Almost surely, 215015211039 is an apocalyptic number.

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

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

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

The sum of its prime factors is 29289.

The product of its (nonzero) digits is 1350, while the sum is 28.

The spelling of 15015211039 in words is "fifteen billion, fifteen million, two hundred eleven thousand, thirty-nine".

Divisors: 1 139 4357 24793 605623 3446227 108023101 15015211039