Search a number
-
+
15061716052 = 225636688151
BaseRepresentation
bin11100000011011111…
…11000110001010100
31102212200021110012021
432001233320301110
5221321244403202
610530320502524
71042146321415
oct160157706124
942780243167
1015061716052
116429a45219
122b0417aa44
131560577126
14a2c4cb80c
155d2455a37
hex381bf8c54

15061716052 has 12 divisors (see below), whose sum is σ = 26404824096. Its totient is φ = 7517480600.

The previous prime is 15061716023. The next prime is 15061716067. The reversal of 15061716052 is 25061716051.

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

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

It is a congruent number.

It is an unprimeable number.

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, 3341824 + ... + 3346327.

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

Almost surely, 215061716052 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6688718 (or 6688716 counting only the distinct ones).

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

Subtracting 15061716052 from its reverse (25061716051), we obtain a palindrome (9999999999).

The spelling of 15061716052 in words is "fifteen billion, sixty-one million, seven hundred sixteen thousand, fifty-two".

Divisors: 1 2 4 563 1126 2252 6688151 13376302 26752604 3765429013 7530858026 15061716052