Base | Representation |
---|---|
bin | 1110110100011001011100… |
… | …1001000101101101111001 |
3 | 2010200121222100022222021011 |
4 | 3231012113021011231321 |
5 | 4113422233223233212 |
6 | 54353020553513521 |
7 | 3301104214545424 |
oct | 355062711055571 |
9 | 63617870288234 |
10 | 16293346696057 |
11 | 5211a73496a72 |
12 | 19b1914a128a1 |
13 | 9125c0aab382 |
14 | 4048605909bb |
15 | 1d3c624054a7 |
hex | ed197245b79 |
16293346696057 has 2 divisors, whose sum is σ = 16293346696058. Its totient is φ = 16293346696056.
The previous prime is 16293346695961. The next prime is 16293346696063. The reversal of 16293346696057 is 75069664339261.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10246842742761 + 6046503953296 = 3201069^2 + 2458964^2 .
It is an emirp because it is prime and its reverse (75069664339261) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 16293346696057 - 27 = 16293346695929 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 16293346695983 and 16293346696001.
It is not a weakly prime, because it can be changed into another prime (16293346606057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 8146673348028 + 8146673348029.
It is an arithmetic number, because the mean of its divisors is an integer number (8146673348029).
Almost surely, 216293346696057 is an apocalyptic number.
It is an amenable number.
16293346696057 is a deficient number, since it is larger than the sum of its proper divisors (1).
16293346696057 is an equidigital number, since it uses as much as digits as its factorization.
16293346696057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 264539520, while the sum is 67.
The spelling of 16293346696057 in words is "sixteen trillion, two hundred ninety-three billion, three hundred forty-six million, six hundred ninety-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •