Base | Representation |
---|---|
bin | 10011001000101… |
… | …11111010110101 |
3 | 102012001202220022 |
4 | 21210113322311 |
5 | 312043430401 |
6 | 23532414525 |
7 | 3656324534 |
oct | 1144277265 |
9 | 365052808 |
10 | 160530101 |
11 | 82684706 |
12 | 45917445 |
13 | 27347b34 |
14 | 1746a31b |
15 | e15e71b |
hex | 9917eb5 |
160530101 has 8 divisors (see below), whose sum is σ = 165000600. Its totient is φ = 156119040.
The previous prime is 160530089. The next prime is 160530103. The reversal of 160530101 is 101035061.
It can be written as a sum of positive squares in 4 ways, for example, as 532900 + 159997201 = 730^2 + 12649^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 160530101 - 210 = 160529077 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 160530101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160530103) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9356 + ... + 20213.
It is an arithmetic number, because the mean of its divisors is an integer number (20625075).
Almost surely, 2160530101 is an apocalyptic number.
It is an amenable number.
160530101 is a deficient number, since it is larger than the sum of its proper divisors (4470499).
160530101 is an equidigital number, since it uses as much as digits as its factorization.
160530101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29719.
The product of its (nonzero) digits is 90, while the sum is 17.
The square root of 160530101 is about 12670.0473953336. The cubic root of 160530101 is about 543.4824105299.
Adding to 160530101 its reverse (101035061), we get a palindrome (261565162).
The spelling of 160530101 in words is "one hundred sixty million, five hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •