Base | Representation |
---|---|
bin | 11111101001000100… |
… | …00100100111011001 |
3 | 1121211212221010000021 |
4 | 33310202010213121 |
5 | 234242243140033 |
6 | 11445352310441 |
7 | 1140652102261 |
oct | 176442044731 |
9 | 47755833007 |
10 | 16987474393 |
11 | 7227a93a3a |
12 | 33610a2421 |
13 | 17a95290c6 |
14 | b7217c7a1 |
15 | 696550b2d |
hex | 3f48849d9 |
16987474393 has 4 divisors (see below), whose sum is σ = 17006122368. Its totient is φ = 16968826420.
The previous prime is 16987474369. The next prime is 16987474423. The reversal of 16987474393 is 39347478961.
16987474393 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.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16987474393 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (16987471393) 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 in 3 ways as a sum of consecutive naturals, for example, 9322621 + ... + 9324442.
It is an arithmetic number, because the mean of its divisors is an integer number (4251530592).
Almost surely, 216987474393 is an apocalyptic number.
It is an amenable number.
16987474393 is a deficient number, since it is larger than the sum of its proper divisors (18647975).
16987474393 is an equidigital number, since it uses as much as digits as its factorization.
16987474393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18647974.
The product of its digits is 27433728, while the sum is 61.
The spelling of 16987474393 in words is "sixteen billion, nine hundred eighty-seven million, four hundred seventy-four thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •