Base | Representation |
---|---|
bin | 11110110001010011… |
… | …11001110000000101 |
3 | 1120122021212000100001 |
4 | 33120221321300011 |
5 | 232313024434442 |
6 | 11331123521301 |
7 | 1123242454111 |
oct | 173051716005 |
9 | 46567760301 |
10 | 16519764997 |
11 | 7007a81a4a |
12 | 3250529231 |
13 | 173366b798 |
14 | b29dd0741 |
15 | 66a4652b7 |
hex | 3d8a79c05 |
16519764997 has 2 divisors, whose sum is σ = 16519764998. Its totient is φ = 16519764996.
The previous prime is 16519764991. The next prime is 16519765139. The reversal of 16519764997 is 79946791561.
16519764997 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., 13743107361 + 2776657636 = 117231^2 + 52694^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16519764997 is a prime.
It is a super-2 number, since 2×165197649972 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16519764991) 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, 8259882498 + 8259882499.
It is an arithmetic number, because the mean of its divisors is an integer number (8259882499).
Almost surely, 216519764997 is an apocalyptic number.
It is an amenable number.
16519764997 is a deficient number, since it is larger than the sum of its proper divisors (1).
16519764997 is an equidigital number, since it uses as much as digits as its factorization.
16519764997 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 25719120, while the sum is 64.
The spelling of 16519764997 in words is "sixteen billion, five hundred nineteen million, seven hundred sixty-four thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •