Base | Representation |
---|---|
bin | 11111000000101110… |
… | …01110100111011001 |
3 | 1120222022012021101111 |
4 | 33200113032213121 |
5 | 233044131244244 |
6 | 11352023420321 |
7 | 1126402623361 |
oct | 174027164731 |
9 | 46868167344 |
10 | 16649087449 |
11 | 7073a80905 |
12 | 32878b46a1 |
13 | 17543aaa47 |
14 | b3d2559a1 |
15 | 6769ace34 |
hex | 3e05ce9d9 |
16649087449 has 2 divisors, whose sum is σ = 16649087450. Its totient is φ = 16649087448.
The previous prime is 16649087417. The next prime is 16649087453. The reversal of 16649087449 is 94478094661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9827153424 + 6821934025 = 99132^2 + 82595^2 .
It is an emirp because it is prime and its reverse (94478094661) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16649087449 - 25 = 16649087417 is a prime.
It is a super-2 number, since 2×166490874492 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 16649087393 and 16649087402.
It is not a weakly prime, because it can be changed into another prime (16649087489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8324543724 + 8324543725.
It is an arithmetic number, because the mean of its divisors is an integer number (8324543725).
Almost surely, 216649087449 is an apocalyptic number.
It is an amenable number.
16649087449 is a deficient number, since it is larger than the sum of its proper divisors (1).
16649087449 is an equidigital number, since it uses as much as digits as its factorization.
16649087449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10450944, while the sum is 58.
The spelling of 16649087449 in words is "sixteen billion, six hundred forty-nine million, eighty-seven thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •