Base | Representation |
---|---|
bin | 111101101000… |
… | …100001011100 |
3 | 1010101211220200 |
4 | 331220201130 |
5 | 13114004024 |
6 | 1334143500 |
7 | 254221161 |
oct | 75504134 |
9 | 33354820 |
10 | 16156764 |
11 | 91358a8 |
12 | 54b1b90 |
13 | 3469020 |
14 | 2208068 |
15 | 16422c9 |
hex | f6885c |
16156764 has 144 divisors (see below), whose sum is σ = 48921600. Its totient is φ = 4447872.
The previous prime is 16156733. The next prime is 16156781. The reversal of 16156764 is 46765161.
16156764 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×161567642 = 522082045903392, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
Its product of digits (30240) is a multiple of the sum of its prime factors (144).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 204477 + ... + 204555.
Almost surely, 216156764 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 16156764, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24460800).
16156764 is an abundant number, since it is smaller than the sum of its proper divisors (32764836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16156764 is a wasteful number, since it uses less digits than its factorization.
16156764 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 144 (or 139 counting only the distinct ones).
The product of its digits is 30240, while the sum is 36.
The square root of 16156764 is about 4019.5477357534. The cubic root of 16156764 is about 252.8044962280.
The spelling of 16156764 in words is "sixteen million, one hundred fifty-six thousand, seven hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •