Base | Representation |
---|---|
bin | 1001010101110111111… |
… | …0100111101100001011 |
3 | 120100020212011110001001 |
4 | 2111131332213230023 |
5 | 10112141031032124 |
6 | 201421152035431 |
7 | 14411050425055 |
oct | 2253576475413 |
9 | 510225143031 |
10 | 160490486539 |
11 | 62077771a39 |
12 | 2712bb32b77 |
13 | 12198a70746 |
14 | 7aa6b108d5 |
15 | 4294a76b44 |
hex | 255dfa7b0b |
160490486539 has 4 divisors (see below), whose sum is σ = 165667599040. Its totient is φ = 155313374040.
The previous prime is 160490486461. The next prime is 160490486549. The reversal of 160490486539 is 935684094061.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 935684094061 = 359 ⋅2606362379.
It is not a de Polignac number, because 160490486539 - 27 = 160490486411 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 160490486539.
It is not an unprimeable number, because it can be changed into a prime (160490486549) 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 in 3 ways as a sum of consecutive naturals, for example, 2588556204 + ... + 2588556265.
It is an arithmetic number, because the mean of its divisors is an integer number (41416899760).
Almost surely, 2160490486539 is an apocalyptic number.
160490486539 is a deficient number, since it is larger than the sum of its proper divisors (5177112501).
160490486539 is an equidigital number, since it uses as much as digits as its factorization.
160490486539 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5177112500.
The product of its (nonzero) digits is 5598720, while the sum is 55.
The spelling of 160490486539 in words is "one hundred sixty billion, four hundred ninety million, four hundred eighty-six thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •