Base | Representation |
---|---|
bin | 111101001111… |
… | …001110011011 |
3 | 1010012120210000 |
4 | 331033032123 |
5 | 13102200042 |
6 | 1332024043 |
7 | 253310115 |
oct | 75171633 |
9 | 33176700 |
10 | 16053147 |
11 | 9074a70 |
12 | 5462023 |
13 | 3430b06 |
14 | 21bc3b5 |
15 | 162174c |
hex | f4f39b |
16053147 has 40 divisors (see below), whose sum is σ = 26832960. Its totient is φ = 9480240.
The previous prime is 16053143. The next prime is 16053199. The reversal of 16053147 is 74135061.
It is not a de Polignac number, because 16053147 - 22 = 16053143 is a prime.
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 16053147.
It is not an unprimeable number, because it can be changed into a prime (16053143) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 38104 + ... + 38522.
It is an arithmetic number, because the mean of its divisors is an integer number (670824).
Almost surely, 216053147 is an apocalyptic number.
16053147 is a deficient number, since it is larger than the sum of its proper divisors (10779813).
16053147 is a wasteful number, since it uses less digits than its factorization.
16053147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 485 (or 476 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 16053147 is about 4006.6378673396. The cubic root of 16053147 is about 252.2629058930.
The spelling of 16053147 in words is "sixteen million, fifty-three thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •