Base | Representation |
---|---|
bin | 111101010000… |
… | …000110110100 |
3 | 1010012202201200 |
4 | 331100012310 |
5 | 13102304011 |
6 | 1332052500 |
7 | 253323462 |
oct | 75200664 |
9 | 33182650 |
10 | 16056756 |
11 | 9077751 |
12 | 5464130 |
13 | 3432651 |
14 | 21bd832 |
15 | 1622856 |
hex | f501b4 |
16056756 has 36 divisors (see below), whose sum is σ = 40710852. Its totient is φ = 5336064.
The previous prime is 16056743. The next prime is 16056763. The reversal of 16056756 is 65765061.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 9400356 + 6656400 = 3066^2 + 2580^2 .
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 16056756.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 20386 + ... + 21158.
It is an arithmetic number, because the mean of its divisors is an integer number (1130857).
Almost surely, 216056756 is an apocalyptic number.
It is an amenable number.
16056756 is an abundant number, since it is smaller than the sum of its proper divisors (24654096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
16056756 is a wasteful number, since it uses less digits than its factorization.
16056756 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1360 (or 1355 counting only the distinct ones).
The product of its (nonzero) digits is 37800, while the sum is 36.
The square root of 16056756 is about 4007.0882196428. The cubic root of 16056756 is about 252.2818086998.
The spelling of 16056756 in words is "sixteen million, fifty-six thousand, seven hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •