Base | Representation |
---|---|
bin | 1111010001111001001100… |
… | …0101010111000110011101 |
3 | 2012111001221210101022212212 |
4 | 3310132103011113012131 |
5 | 4200223033144010444 |
6 | 55421504041010205 |
7 | 3352523522131316 |
oct | 364362305270635 |
9 | 65431853338785 |
10 | 16800084750749 |
11 | 539796a956703 |
12 | 1a73b76483965 |
13 | 94b319b99551 |
14 | 4211b262560d |
15 | 1e201e85e19e |
hex | f479315719d |
16800084750749 has 2 divisors, whose sum is σ = 16800084750750. Its totient is φ = 16800084750748.
The previous prime is 16800084750689. The next prime is 16800084750751. The reversal of 16800084750749 is 94705748000861.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13948596587524 + 2851488163225 = 3734782^2 + 1688635^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16800084750749 is a prime.
It is a super-2 number, since 2×168000847507492 (a number of 27 digits) contains 22 as substring.
Together with 16800084750751, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16800084750349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8400042375374 + 8400042375375.
It is an arithmetic number, because the mean of its divisors is an integer number (8400042375375).
Almost surely, 216800084750749 is an apocalyptic number.
It is an amenable number.
16800084750749 is a deficient number, since it is larger than the sum of its proper divisors (1).
16800084750749 is an equidigital number, since it uses as much as digits as its factorization.
16800084750749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 13547520, while the sum is 59.
The spelling of 16800084750749 in words is "sixteen trillion, eight hundred billion, eighty-four million, seven hundred fifty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •