Base | Representation |
---|---|
bin | 111110000010… |
… | …111110010010 |
3 | 1010121100112100 |
4 | 332002332102 |
5 | 13130440411 |
6 | 1340341230 |
7 | 255152064 |
oct | 76027622 |
9 | 33540470 |
10 | 16265106 |
11 | 91aa240 |
12 | 5544816 |
13 | 34a6430 |
14 | 2235734 |
15 | 1664456 |
hex | f82f92 |
16265106 has 96 divisors (see below), whose sum is σ = 42456960. Its totient is φ = 4435200.
The previous prime is 16265063. The next prime is 16265113. The reversal of 16265106 is 60156261.
It is a happy number.
16265106 is a `hidden beast` number, since 1 + 6 + 2 + 651 + 0 + 6 = 666.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 16265106.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 182710 + ... + 182798.
It is an arithmetic number, because the mean of its divisors is an integer number (442260).
Almost surely, 216265106 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16265106, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21228480).
16265106 is an abundant number, since it is smaller than the sum of its proper divisors (26191854).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16265106 is a wasteful number, since it uses less digits than its factorization.
16265106 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 192 (or 189 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 16265106 is about 4033.0021076116. The cubic root of 16265106 is about 253.3683127292.
The spelling of 16265106 in words is "sixteen million, two hundred sixty-five thousand, one hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •