Base | Representation |
---|---|
bin | 10011001101011… |
… | …11100010101111 |
3 | 102020020022211011 |
4 | 21212233202233 |
5 | 312223314101 |
6 | 23554010051 |
7 | 3664522300 |
oct | 1146574257 |
9 | 366208734 |
10 | 161151151 |
11 | 82a69277 |
12 | 45b76927 |
13 | 27504715 |
14 | 1758c7a7 |
15 | e233751 |
hex | 99af8af |
161151151 has 12 divisors (see below), whose sum is σ = 188004240. Its totient is φ = 137729760.
The previous prime is 161151149. The next prime is 161151163. The reversal of 161151151 is 151151161.
It is not a de Polignac number, because 161151151 - 21 = 161151149 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161151251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13011 + ... + 22171.
It is an arithmetic number, because the mean of its divisors is an integer number (15667020).
Almost surely, 2161151151 is an apocalyptic number.
161151151 is a deficient number, since it is larger than the sum of its proper divisors (26853089).
161151151 is an equidigital number, since it uses as much as digits as its factorization.
161151151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9534 (or 9527 counting only the distinct ones).
The product of its digits is 150, while the sum is 22.
The square root of 161151151 is about 12694.5323269508. The cubic root of 161151151 is about 544.1823735689.
The spelling of 161151151 in words is "one hundred sixty-one million, one hundred fifty-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •