Base | Representation |
---|---|
bin | 1111000111011100000010… |
… | …1100100110000001001001 |
3 | 2011211220022112022211222201 |
4 | 3301313000230212001021 |
5 | 4134302201103240003 |
6 | 55203200132520201 |
7 | 3333534345531523 |
oct | 361670054460111 |
9 | 64756275284881 |
10 | 16620461383753 |
11 | 532877517a477 |
12 | 1a451a6a80061 |
13 | 9373c22a4786 |
14 | 41661286aa13 |
15 | 1dc50a250b1d |
hex | f1dc0b26049 |
16620461383753 has 2 divisors, whose sum is σ = 16620461383754. Its totient is φ = 16620461383752.
The previous prime is 16620461383651. The next prime is 16620461383793. The reversal of 16620461383753 is 35738316402661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8443423743049 + 8177037640704 = 2905757^2 + 2859552^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16620461383753 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16620461383694 and 16620461383703.
It is not a weakly prime, because it can be changed into another prime (16620461383793) 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 as a sum of consecutive naturals, namely, 8310230691876 + 8310230691877.
It is an arithmetic number, because the mean of its divisors is an integer number (8310230691877).
Almost surely, 216620461383753 is an apocalyptic number.
It is an amenable number.
16620461383753 is a deficient number, since it is larger than the sum of its proper divisors (1).
16620461383753 is an equidigital number, since it uses as much as digits as its factorization.
16620461383753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 55.
The spelling of 16620461383753 in words is "sixteen trillion, six hundred twenty billion, four hundred sixty-one million, three hundred eighty-three thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •