Base | Representation |
---|---|
bin | 111101011001… |
… | …001000000101 |
3 | 1010021122102000 |
4 | 331121020011 |
5 | 13104444301 |
6 | 1332535513 |
7 | 253536261 |
oct | 75311005 |
9 | 33248360 |
10 | 16093701 |
11 | 90a2488 |
12 | 5481599 |
13 | 3446400 |
14 | 21cd0a1 |
15 | 162d786 |
hex | f59205 |
16093701 has 24 divisors (see below), whose sum is σ = 25824960. Its totient is φ = 9901008.
The previous prime is 16093697. The next prime is 16093709. The reversal of 16093701 is 10739061.
It is not a de Polignac number, because 16093701 - 22 = 16093697 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16093709) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 2800 + ... + 6326.
It is an arithmetic number, because the mean of its divisors is an integer number (1076040).
Almost surely, 216093701 is an apocalyptic number.
It is an amenable number.
16093701 is a deficient number, since it is larger than the sum of its proper divisors (9731259).
16093701 is a wasteful number, since it uses less digits than its factorization.
16093701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3562 (or 3543 counting only the distinct ones).
The product of its (nonzero) digits is 1134, while the sum is 27.
The square root of 16093701 is about 4011.6955268315. The cubic root of 16093701 is about 252.4751522783.
The spelling of 16093701 in words is "sixteen million, ninety-three thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •