Search a number
-
+
15150503230 = 251515050323
BaseRepresentation
bin11100001110000101…
…00101010100111110
31110002212100022022021
432013002211110332
5222012012100410
610543211510354
71044305103232
oct160702452476
943085308267
1015150503230
116475078355
122b29a583ba
131575a93015
14a3a2005c2
155da142eda
hex3870a553e

15150503230 has 8 divisors (see below), whose sum is σ = 27270905832. Its totient is φ = 6060201288.

The previous prime is 15150503191. The next prime is 15150503239. The reversal of 15150503230 is 3230505151.

15150503230 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 215150503230 is an apocalyptic number.

15150503230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.

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

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

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

The sum of its prime factors is 1515050330.

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

The spelling of 15150503230 in words is "fifteen billion, one hundred fifty million, five hundred three thousand, two hundred thirty".

Divisors: 1 2 5 10 1515050323 3030100646 7575251615 15150503230