Base | Representation |
---|---|
bin | 111101010000… |
… | …001101101101 |
3 | 1010012210100000 |
4 | 331100031231 |
5 | 13102312242 |
6 | 1332054513 |
7 | 253324662 |
oct | 75201555 |
9 | 33183300 |
10 | 16057197 |
11 | 9078012 |
12 | 5464439 |
13 | 3432900 |
14 | 21bda69 |
15 | 1622a4c |
hex | f5036d |
16057197 has 72 divisors (see below), whose sum is σ = 28776384. Its totient is φ = 8895744.
The previous prime is 16057193. The next prime is 16057201. The reversal of 16057197 is 79175061.
It is an interprime number because it is at equal distance from previous prime (16057193) and next prime (16057201).
It is not a de Polignac number, because 16057197 - 22 = 16057193 is a prime.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16057193) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 698128 + ... + 698150.
It is an arithmetic number, because the mean of its divisors is an integer number (399672).
Almost surely, 216057197 is an apocalyptic number.
16057197 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
16057197 is a deficient number, since it is larger than the sum of its proper divisors (12719187).
16057197 is a wasteful number, since it uses less digits than its factorization.
16057197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81 (or 56 counting only the distinct ones).
The product of its (nonzero) digits is 13230, while the sum is 36.
The square root of 16057197 is about 4007.1432467532. The cubic root of 16057197 is about 252.2841183249.
The spelling of 16057197 in words is "sixteen million, fifty-seven thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •