Base | Representation |
---|---|
bin | 1001010110000100010… |
… | …0010110011100010001 |
3 | 120100101110200212201201 |
4 | 2111201010112130101 |
5 | 10112242313223101 |
6 | 201430243031201 |
7 | 14412250131151 |
oct | 2254104263421 |
9 | 510343625651 |
10 | 160542320401 |
11 | 620a3a55541 |
12 | 2714536b501 |
13 | 121a671b778 |
14 | 7aad964761 |
15 | 42993b4e01 |
hex | 2561116711 |
160542320401 has 4 divisors (see below), whose sum is σ = 167522421312. Its totient is φ = 153562219492.
The previous prime is 160542320383. The next prime is 160542320413. The reversal of 160542320401 is 104023245061.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 160542320401 - 213 = 160542312209 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 160542320401.
It is not an unprimeable number, because it can be changed into a prime (160542320441) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3490050421 + ... + 3490050466.
It is an arithmetic number, because the mean of its divisors is an integer number (41880605328).
Almost surely, 2160542320401 is an apocalyptic number.
It is an amenable number.
160542320401 is a deficient number, since it is larger than the sum of its proper divisors (6980100911).
160542320401 is an equidigital number, since it uses as much as digits as its factorization.
160542320401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6980100910.
The product of its (nonzero) digits is 5760, while the sum is 28.
Adding to 160542320401 its reverse (104023245061), we get a palindrome (264565565462).
The spelling of 160542320401 in words is "one hundred sixty billion, five hundred forty-two million, three hundred twenty thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •