Search a number
-
+
16161060510 = 2325753521929
BaseRepresentation
bin11110000110100011…
…00011011010011110
31112201021212221021200
433003101203122132
5231044212414020
611231351340330
71111325514330
oct170321433236
945637787250
1016161060510
116943551a61
1231703816a6
1316a72585ca
14ad44d9450
15648c0c590
hex3c346369e

16161060510 has 192 divisors, whose sum is σ = 49074180480. Its totient is φ = 3613409280.

The previous prime is 16161060493. The next prime is 16161060529. The reversal of 16161060510 is 1506016161.

It is a super-2 number, since 2×161610605102 (a number of 21 digits) contains 22 as substring.

It is a Curzon number.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 17395726 + ... + 17396654.

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

Almost surely, 216161060510 is an apocalyptic number.

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

It is a practical number, because each smaller number is the sum of distinct divisors of 16161060510, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24537090240).

16161060510 is an abundant number, since it is smaller than the sum of its proper divisors (32913119970).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

16161060510 is an evil number, because the sum of its binary digits is even.

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

The product of its (nonzero) digits is 1080, while the sum is 27.

Adding to 16161060510 its reverse (1506016161), we get a palindrome (17667076671).

The spelling of 16161060510 in words is "sixteen billion, one hundred sixty-one million, sixty thousand, five hundred ten".