Base | Representation |
---|---|
bin | 111110011001… |
… | …000101010100 |
3 | 1010202221202111 |
4 | 332121011110 |
5 | 13141340133 |
6 | 1342320404 |
7 | 256010110 |
oct | 76310524 |
9 | 33687674 |
10 | 16355668 |
11 | 926128a |
12 | 5589104 |
13 | 3508714 |
14 | 225a740 |
15 | 16811cd |
hex | f99154 |
16355668 has 48 divisors (see below), whose sum is σ = 34594560. Its totient is φ = 6614784.
The previous prime is 16355657. The next prime is 16355687. The reversal of 16355668 is 86655361.
16355668 is digitally balanced in base 2 and base 8, because in such bases it contains all the possibile digits an equal number of times.
16355668 is strictly pandigital in base 8.
It is a self number, because there is not a number n which added to its sum of digits gives 16355668.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 70080 + ... + 70312.
It is an arithmetic number, because the mean of its divisors is an integer number (720720).
Almost surely, 216355668 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 16355668, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17297280).
16355668 is an abundant number, since it is smaller than the sum of its proper divisors (18238892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16355668 is a wasteful number, since it uses less digits than its factorization.
16355668 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 376 (or 374 counting only the distinct ones).
The product of its digits is 129600, while the sum is 40.
The square root of 16355668 is about 4044.2141387419. The cubic root of 16355668 is about 253.8376833038.
The spelling of 16355668 in words is "sixteen million, three hundred fifty-five thousand, six hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •