Base | Representation |
---|---|
bin | 100100101111100110101011… |
… | …001000011001001000100111 |
3 | 210012011220110122001011112001 |
4 | 210233212223020121020213 |
5 | 132140132334444203124 |
6 | 1331410252014110131 |
7 | 46016200546365526 |
oct | 4457465310311047 |
9 | 705156418034461 |
10 | 161601015616039 |
11 | 4754467342706a |
12 | 1615b4391ab347 |
13 | 6c22bab1644ac |
14 | 2bc9760a8a4bd |
15 | 13a392ebbeb44 |
hex | 92f9ab219227 |
161601015616039 has 2 divisors, whose sum is σ = 161601015616040. Its totient is φ = 161601015616038.
The previous prime is 161601015616021. The next prime is 161601015616069. The reversal of 161601015616039 is 930616510106161.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 161601015616039 - 27 = 161601015615911 is a prime.
It is a super-2 number, since 2×1616010156160392 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 161601015616039.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (161601015616069) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80800507808019 + 80800507808020.
It is an arithmetic number, because the mean of its divisors is an integer number (80800507808020).
Almost surely, 2161601015616039 is an apocalyptic number.
161601015616039 is a deficient number, since it is larger than the sum of its proper divisors (1).
161601015616039 is an equidigital number, since it uses as much as digits as its factorization.
161601015616039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 174960, while the sum is 46.
The spelling of 161601015616039 in words is "one hundred sixty-one trillion, six hundred one billion, fifteen million, six hundred sixteen thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •