Base | Representation |
---|---|
bin | 11111101000110110… |
… | …00110110001110001 |
3 | 1121211202111100000000 |
4 | 33310123012301301 |
5 | 234241311220431 |
6 | 11445245220213 |
7 | 1140630425232 |
oct | 176433066161 |
9 | 47752440000 |
10 | 16985648241 |
11 | 7226a56a21 |
12 | 3360561669 |
13 | 17a9039b43 |
14 | b71c25089 |
15 | 6962de9e6 |
hex | 3f46c6c71 |
16985648241 has 27 divisors (see below), whose sum is σ = 25493021931. Its totient is φ = 11316727728.
The previous prime is 16985648231. The next prime is 16985648359. The reversal of 16985648241 is 14284658961.
The square root of 16985648241 is 130329.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 16607734641 + 377913600 = 128871^2 + 19440^2 .
It is a tau number, because it is divible by the number of its divisors (27).
It is not a de Polignac number, because 16985648241 - 211 = 16985646193 is a prime.
It is not an unprimeable number, because it can be changed into a prime (16985648231) 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 in 26 ways as a sum of consecutive naturals, for example, 10555845 + ... + 10557453.
Almost surely, 216985648241 is an apocalyptic number.
16985648241 is the 130329-th square number.
16985648241 is the 65165-th centered octagonal number.
It is an amenable number.
16985648241 is a deficient number, since it is larger than the sum of its proper divisors (8507373690).
16985648241 is an frugal number, since it uses more digits than its factorization.
16985648241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3242 (or 1612 counting only the distinct ones).
The product of its digits is 3317760, while the sum is 54.
The spelling of 16985648241 in words is "sixteen billion, nine hundred eighty-five million, six hundred forty-eight thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •