Search a number
-
+
15102355051 = 76156896217
BaseRepresentation
bin11100001000010101…
…11010011001101011
31102222111202010102101
432010022322121223
5221412200330201
610534331514231
71043151620440
oct160412723153
942874663371
1015102355051
11644a981973
122b158b8977
131568b05784
14a33a699c7
155d5cd1d01
hex3842ba66b

15102355051 has 16 divisors (see below), whose sum is σ = 17548688320. Its totient is φ = 12728378880.

The previous prime is 15102355031. The next prime is 15102355069. The reversal of 15102355051 is 15055320151.

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

It is not a de Polignac number, because 15102355051 - 25 = 15102355019 is a prime.

It is a super-3 number, since 3×151023550513 (a number of 32 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a Duffinian number.

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

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

Almost surely, 215102355051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 11974.

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

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

Divisors: 1 7 61 427 5689 6217 39823 43519 347029 379237 2429203 2654659 35368513 247579591 2157479293 15102355051