Base | Representation |
---|---|
bin | 11101111111111101… |
… | …10001001011011010 |
3 | 1112120102220122022000 |
4 | 32333332301023122 |
5 | 230441041221011 |
6 | 11222055141430 |
7 | 1110055036161 |
oct | 167776611332 |
9 | 45512818260 |
10 | 16105804506 |
11 | 6915341340 |
12 | 3155974876 |
13 | 169897ca4c |
14 | acb0343d8 |
15 | 643e45356 |
hex | 3bffb12da |
16105804506 has 64 divisors (see below), whose sum is σ = 39101875200. Its totient is φ = 4873359600.
The previous prime is 16105804493. The next prime is 16105804543. The reversal of 16105804506 is 60540850161.
16105804506 is a `hidden beast` number, since 16 + 10 + 580 + 4 + 50 + 6 = 666.
It is a super-3 number, since 3×161058045063 (a number of 32 digits) contains 333 as substring.
It is a Curzon number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 390835 + ... + 430073.
It is an arithmetic number, because the mean of its divisors is an integer number (610966800).
Almost surely, 216105804506 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16105804506, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19550937600).
16105804506 is an abundant number, since it is smaller than the sum of its proper divisors (22996070694).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16105804506 is a wasteful number, since it uses less digits than its factorization.
16105804506 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39952 (or 39946 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The spelling of 16105804506 in words is "sixteen billion, one hundred five million, eight hundred four thousand, five hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •