Base | Representation |
---|---|
bin | 111111011111… |
… | …000000000001 |
3 | 1011022111121012 |
4 | 333133000001 |
5 | 13230021144 |
6 | 1352410305 |
7 | 261312044 |
oct | 77370001 |
9 | 34274535 |
10 | 16642049 |
11 | 9437466 |
12 | 56a6995 |
13 | 35a8b88 |
14 | 22d2c5b |
15 | 16dae9e |
hex | fdf001 |
16642049 has 4 divisors (see below), whose sum is σ = 16651440. Its totient is φ = 16632660.
The previous prime is 16642039. The next prime is 16642069. The reversal of 16642049 is 94024661.
It is a happy number.
16642049 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 16642049 - 24 = 16642033 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (16642039) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1139 + ... + 5880.
It is an arithmetic number, because the mean of its divisors is an integer number (4162860).
It is a Proth number, since it is equal to 4063 ⋅ 212 + 1 and 4063 < 212.
Almost surely, 216642049 is an apocalyptic number.
It is an amenable number.
16642049 is a deficient number, since it is larger than the sum of its proper divisors (9391).
16642049 is an equidigital number, since it uses as much as digits as its factorization.
16642049 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9390.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 16642049 is about 4079.4667543688. The cubic root of 16642049 is about 255.3106504917.
The spelling of 16642049 in words is "sixteen million, six hundred forty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •