Base | Representation |
---|---|
bin | 11110000110110000… |
… | …10010010111000100 |
3 | 1112201102012121121220 |
4 | 33003120102113010 |
5 | 231100140410133 |
6 | 11231453240340 |
7 | 1111346515503 |
oct | 170330222704 |
9 | 45642177556 |
10 | 16162825668 |
11 | 6944548170 |
12 | 3170a930b0 |
13 | 16a7725b92 |
14 | ad483883a |
15 | 648e5a5b3 |
hex | 3c36125c4 |
16162825668 has 96 divisors (see below), whose sum is σ = 41829204480. Its totient is φ = 4816247040.
The previous prime is 16162825649. The next prime is 16162825669. The reversal of 16162825668 is 86652826161.
It is a super-2 number, since 2×161628256682 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 16162825668.
It is not an unprimeable number, because it can be changed into a prime (16162825669) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 6534480 + ... + 6536952.
It is an arithmetic number, because the mean of its divisors is an integer number (435720880).
Almost surely, 216162825668 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 16162825668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20914602240).
16162825668 is an abundant number, since it is smaller than the sum of its proper divisors (25666378812).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16162825668 is a wasteful number, since it uses less digits than its factorization.
16162825668 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3297 (or 3295 counting only the distinct ones).
The product of its digits is 1658880, while the sum is 51.
The spelling of 16162825668 in words is "sixteen billion, one hundred sixty-two million, eight hundred twenty-five thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •