Base | Representation |
---|---|
bin | 11101111111111011… |
… | …11111101001001010 |
3 | 1112120102112022222100 |
4 | 32333331333221022 |
5 | 230441013222420 |
6 | 11222050534230 |
7 | 1110053232510 |
oct | 167775775112 |
9 | 45512468870 |
10 | 16105601610 |
11 | 691521295a |
12 | 3155897376 |
13 | 169890b5a7 |
14 | acadc04b0 |
15 | 643e05190 |
hex | 3bff7fa4a |
16105601610 has 384 divisors, whose sum is σ = 52703239680. Its totient is φ = 3328376832.
The previous prime is 16105601597. The next prime is 16105601651. The reversal of 16105601610 is 1610650161.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 38437981 + ... + 38438399.
It is an arithmetic number, because the mean of its divisors is an integer number (137248020).
Almost surely, 216105601610 is an apocalyptic number.
16105601610 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 16105601610, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (26351619840).
16105601610 is an abundant number, since it is smaller than the sum of its proper divisors (36597638070).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16105601610 is a wasteful number, since it uses less digits than its factorization.
16105601610 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 590 (or 587 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The spelling of 16105601610 in words is "sixteen billion, one hundred five million, six hundred one thousand, six hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •