Search a number
-
+
16511156030 = 251651115603
BaseRepresentation
bin11110110000010010…
…00011111100111110
31120121200122122001102
433120021003330332
5232303323443110
611330215213102
71123106340065
oct173011037476
946550578042
1016511156030
1170031319a6
123249677192
131731946115
14b28bcd1dc
156698145a5
hex3d8243f3e

16511156030 has 8 divisors (see below), whose sum is σ = 29720080872. Its totient is φ = 6604462408.

The previous prime is 16511156021. The next prime is 16511156033. The reversal of 16511156030 is 3065111561.

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

It is a Curzon number.

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

It is a congruent number.

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

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

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

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

Almost surely, 216511156030 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 1651115610.

The product of its (nonzero) digits is 2700, while the sum is 29.

Adding to 16511156030 its reverse (3065111561), we get a palindrome (19576267591).

The spelling of 16511156030 in words is "sixteen billion, five hundred eleven million, one hundred fifty-six thousand, thirty".

Divisors: 1 2 5 10 1651115603 3302231206 8255578015 16511156030