Search a number
-
+
15353056051 = 59311983431
BaseRepresentation
bin11100100110001110…
…10000101100110011
31110121222111001112121
432103013100230303
5222420340243201
611015245135111
71052314552234
oct162307205463
943558431477
1015353056051
116569444283
122b8585a497
1315a8a32268
14a5908908b
155ecd039a1
hex3931d0b33

15353056051 has 8 divisors (see below), whose sum is σ = 15618470400. Its totient is φ = 15087814920.

The previous prime is 15353056007. The next prime is 15353056073. The reversal of 15353056051 is 15065035351.

15353056051 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 cyclic number.

It is not a de Polignac number, because 15353056051 - 221 = 15350958899 is a prime.

It is a Duffinian number.

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

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

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

Almost surely, 215353056051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 86609.

The product of its (nonzero) digits is 33750, while the sum is 34.

The spelling of 15353056051 in words is "fifteen billion, three hundred fifty-three million, fifty-six thousand, fifty-one".

Divisors: 1 59 3119 83431 184021 4922429 260221289 15353056051