Base | Representation |
---|---|
bin | 11111001000110100… |
… | …10101010000011101 |
3 | 1121011001000002112122 |
4 | 33210122111100131 |
5 | 233214023304244 |
6 | 11402451312325 |
7 | 1131156145223 |
oct | 174432252035 |
9 | 47131002478 |
10 | 16717009949 |
11 | 70a9353002 |
12 | 32a65ab6a5 |
13 | 176549ca83 |
14 | b48296b13 |
15 | 67c9281ee |
hex | 3e469541d |
16717009949 has 2 divisors, whose sum is σ = 16717009950. Its totient is φ = 16717009948.
The previous prime is 16717009931. The next prime is 16717009979. The reversal of 16717009949 is 94990071761.
16717009949 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12430689049 + 4286320900 = 111493^2 + 65470^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16717009949 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 16717009949.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16717009979) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8358504974 + 8358504975.
It is an arithmetic number, because the mean of its divisors is an integer number (8358504975).
Almost surely, 216717009949 is an apocalyptic number.
It is an amenable number.
16717009949 is a deficient number, since it is larger than the sum of its proper divisors (1).
16717009949 is an equidigital number, since it uses as much as digits as its factorization.
16717009949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 857304, while the sum is 53.
The spelling of 16717009949 in words is "sixteen billion, seven hundred seventeen million, nine thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •