Base | Representation |
---|---|
bin | 10011000101001… |
… | …01011011100101 |
3 | 102011011221122000 |
4 | 21202211123211 |
5 | 311433424112 |
6 | 23514355513 |
7 | 3652332414 |
oct | 1142453345 |
9 | 364157560 |
10 | 160061157 |
11 | 82394353 |
12 | 4572bb99 |
13 | 27212559 |
14 | 1738747b |
15 | e0ba7dc |
hex | 98a56e5 |
160061157 has 16 divisors (see below), whose sum is σ = 238505280. Its totient is φ = 106087536.
The previous prime is 160061147. The next prime is 160061173. The reversal of 160061157 is 751160061.
160061157 is a `hidden beast` number, since 1 + 600 + 6 + 1 + 1 + 57 = 666.
160061157 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 160061157 - 215 = 160028389 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 160061157.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (160061107) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12463 + ... + 21804.
It is an arithmetic number, because the mean of its divisors is an integer number (14906580).
Almost surely, 2160061157 is an apocalyptic number.
It is an amenable number.
160061157 is a deficient number, since it is larger than the sum of its proper divisors (78444123).
160061157 is a wasteful number, since it uses less digits than its factorization.
160061157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34449 (or 34443 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 27.
The square root of 160061157 is about 12651.5278523979. The cubic root of 160061157 is about 542.9526835239.
The spelling of 160061157 in words is "one hundred sixty million, sixty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •