Base | Representation |
---|---|
bin | 111101001110… |
… | …010001100011 |
3 | 1010012101102201 |
4 | 331032101203 |
5 | 13102034001 |
6 | 1331554031 |
7 | 253262551 |
oct | 75162143 |
9 | 33171381 |
10 | 16049251 |
11 | 9072049 |
12 | 545b917 |
13 | 342c0ca |
14 | 21babd1 |
15 | 1620501 |
hex | f4e463 |
16049251 has 4 divisors (see below), whose sum is σ = 16199352. Its totient is φ = 15899152.
The previous prime is 16049183. The next prime is 16049261. The reversal of 16049251 is 15294061.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 15294061 = 37 ⋅413353.
It is a cyclic number.
It is not a de Polignac number, because 16049251 - 211 = 16047203 is a prime.
It is a super-2 number, since 2×160492512 = 515156915322002, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16049261) 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 3 ways as a sum of consecutive naturals, for example, 74890 + ... + 75103.
It is an arithmetic number, because the mean of its divisors is an integer number (4049838).
Almost surely, 216049251 is an apocalyptic number.
16049251 is a deficient number, since it is larger than the sum of its proper divisors (150101).
16049251 is a wasteful number, since it uses less digits than its factorization.
16049251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 150100.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 16049251 is about 4006.1516446585. The cubic root of 16049251 is about 252.2424966901.
The spelling of 16049251 in words is "sixteen million, forty-nine thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •