Base | Representation |
---|---|
bin | 111101000110… |
… | …001100011101 |
3 | 1010010201001000 |
4 | 331012030131 |
5 | 13100004112 |
6 | 1331140513 |
7 | 253064223 |
oct | 75061435 |
9 | 33121030 |
10 | 16016157 |
11 | 904a1a3 |
12 | 5444739 |
13 | 341a021 |
14 | 21acb13 |
15 | 16157dc |
hex | f4631d |
16016157 has 16 divisors (see below), whose sum is σ = 23823360. Its totient is φ = 10634400.
The previous prime is 16016113. The next prime is 16016177. The reversal of 16016157 is 75161061.
16016157 is a `hidden beast` number, since 1 + 601 + 6 + 1 + 57 = 666.
It is not a de Polignac number, because 16016157 - 26 = 16016093 is a prime.
It is a super-3 number, since 3×160161573 (a number of 23 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 16016157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16016177) 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 15 ways as a sum of consecutive naturals, for example, 6532 + ... + 8642.
It is an arithmetic number, because the mean of its divisors is an integer number (1488960).
Almost surely, 216016157 is an apocalyptic number.
It is an amenable number.
16016157 is a deficient number, since it is larger than the sum of its proper divisors (7807203).
16016157 is a wasteful number, since it uses less digits than its factorization.
16016157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2401 (or 2395 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 16016157 is about 4002.0191153966. The cubic root of 16016157 is about 252.0690003796.
The spelling of 16016157 in words is "sixteen million, sixteen thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •