Base | Representation |
---|---|
bin | 1001010110010011100… |
… | …1111100100110100101 |
3 | 120100112221211210122222 |
4 | 2111210321330212211 |
5 | 10112410303430424 |
6 | 201440503002125 |
7 | 14413661304446 |
oct | 2254471744645 |
9 | 510487753588 |
10 | 160606701989 |
11 | 62127329368 |
12 | 27162a39345 |
13 | 121b6b70b96 |
14 | 7ab83232cd |
15 | 429ed80e5e |
hex | 2564e7c9a5 |
160606701989 has 2 divisors, whose sum is σ = 160606701990. Its totient is φ = 160606701988.
The previous prime is 160606701979. The next prime is 160606702013. The reversal of 160606701989 is 989107606061.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 133436784100 + 27169917889 = 365290^2 + 164833^2 .
It is an emirp because it is prime and its reverse (989107606061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 160606701989 - 224 = 160589924773 is a prime.
It is a super-2 number, since 2×1606067019892 (a number of 23 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 160606701989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (160606701979) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80303350994 + 80303350995.
It is an arithmetic number, because the mean of its divisors is an integer number (80303350995).
Almost surely, 2160606701989 is an apocalyptic number.
It is an amenable number.
160606701989 is a deficient number, since it is larger than the sum of its proper divisors (1).
160606701989 is an equidigital number, since it uses as much as digits as its factorization.
160606701989 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 979776, while the sum is 53.
The spelling of 160606701989 in words is "one hundred sixty billion, six hundred six million, seven hundred one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •