Base | Representation |
---|---|
bin | 1001110011001100001… |
… | …0000100001100111011 |
3 | 121002120021212021110012 |
4 | 2130303002010030323 |
5 | 10224300113412214 |
6 | 205202105012135 |
7 | 15110054400224 |
oct | 2346302041473 |
9 | 532507767405 |
10 | 168359904059 |
11 | 6544585a886 |
12 | 2876748404b |
13 | 12b51222c09 |
14 | 8211d0624b |
15 | 45a587b03e |
hex | 273308433b |
168359904059 has 2 divisors, whose sum is σ = 168359904060. Its totient is φ = 168359904058.
The previous prime is 168359903993. The next prime is 168359904091. The reversal of 168359904059 is 950409953861.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-168359904059 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 168359903989 and 168359904007.
It is not a weakly prime, because it can be changed into another prime (168359904259) 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, 84179952029 + 84179952030.
It is an arithmetic number, because the mean of its divisors is an integer number (84179952030).
Almost surely, 2168359904059 is an apocalyptic number.
168359904059 is a deficient number, since it is larger than the sum of its proper divisors (1).
168359904059 is an equidigital number, since it uses as much as digits as its factorization.
168359904059 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10497600, while the sum is 59.
The spelling of 168359904059 in words is "one hundred sixty-eight billion, three hundred fifty-nine million, nine hundred four thousand, fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •