Base | Representation |
---|---|
bin | 100100011000011101000001… |
… | …110100111100100010111001 |
3 | 202222112211001202100121211212 |
4 | 210120131001310330202321 |
5 | 131433101201404323001 |
6 | 1324151344043132505 |
7 | 45463230500355116 |
oct | 4430350164744271 |
9 | 688484052317755 |
10 | 160010111011001 |
11 | 46a909a8235519 |
12 | 15b43046514135 |
13 | 6b38b726ac184 |
14 | 2b7276032790d |
15 | 137736bd5c7bb |
hex | 918741d3c8b9 |
160010111011001 has 2 divisors, whose sum is σ = 160010111011002. Its totient is φ = 160010111011000.
The previous prime is 160010111010991. The next prime is 160010111011103. The reversal of 160010111011001 is 100110111010061.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 151544076984976 + 8466034026025 = 12310324^2 + 2909645^2 .
It is an emirp because it is prime and its reverse (100110111010061) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 160010111011001 - 230 = 160009037269177 is a prime.
It is not a weakly prime, because it can be changed into another prime (160010111011901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 80005055505500 + 80005055505501.
It is an arithmetic number, because the mean of its divisors is an integer number (80005055505501).
Almost surely, 2160010111011001 is an apocalyptic number.
It is an amenable number.
160010111011001 is a deficient number, since it is larger than the sum of its proper divisors (1).
160010111011001 is an equidigital number, since it uses as much as digits as its factorization.
160010111011001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 14.
Adding to 160010111011001 its reverse (100110111010061), we get a palindrome (260120222021062).
The spelling of 160010111011001 in words is "one hundred sixty trillion, ten billion, one hundred eleven million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •