Base | Representation |
---|---|
bin | 1111001001001000110101… |
… | …0100010110000100001101 |
3 | 2011221200200201111120222122 |
4 | 3302102031110112010031 |
5 | 4140242003011110023 |
6 | 55224430005422325 |
7 | 3335620125166103 |
oct | 362221524260415 |
9 | 64850621446878 |
10 | 16649664160013 |
11 | 533a0a03a9505 |
12 | 1a4a996a0a9a5 |
13 | 93a097449541 |
14 | 417bc306dc73 |
15 | 1dd168da02c8 |
hex | f248d51610d |
16649664160013 has 2 divisors, whose sum is σ = 16649664160014. Its totient is φ = 16649664160012.
The previous prime is 16649664159893. The next prime is 16649664160049. The reversal of 16649664160013 is 31006146694661.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10809911592649 + 5839752567364 = 3287843^2 + 2416558^2 .
It is a cyclic number.
It is not a de Polignac number, because 16649664160013 - 222 = 16649659965709 is a prime.
It is a super-2 number, since 2×166496641600132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (16649664960013) 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, 8324832080006 + 8324832080007.
It is an arithmetic number, because the mean of its divisors is an integer number (8324832080007).
Almost surely, 216649664160013 is an apocalyptic number.
It is an amenable number.
16649664160013 is a deficient number, since it is larger than the sum of its proper divisors (1).
16649664160013 is an equidigital number, since it uses as much as digits as its factorization.
16649664160013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3359232, while the sum is 53.
The spelling of 16649664160013 in words is "sixteen trillion, six hundred forty-nine billion, six hundred sixty-four million, one hundred sixty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •