Base | Representation |
---|---|
bin | 10011001111000… |
… | …00110111000001 |
3 | 102020121120220201 |
4 | 21213200313001 |
5 | 312301300103 |
6 | 24002205201 |
7 | 3666323233 |
oct | 1147406701 |
9 | 366546821 |
10 | 161353153 |
11 | 83097015 |
12 | 46053801 |
13 | 27575650 |
14 | 17602253 |
15 | e27351d |
hex | 99e0dc1 |
161353153 has 8 divisors (see below), whose sum is σ = 173917800. Its totient is φ = 148810368.
The previous prime is 161353151. The next prime is 161353183. The reversal of 161353153 is 351353161.
It can be written as a sum of positive squares in 4 ways, for example, as 68095504 + 93257649 = 8252^2 + 9657^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 161353153 - 21 = 161353151 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (161353151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11943 + ... + 21571.
It is an arithmetic number, because the mean of its divisors is an integer number (21739725).
Almost surely, 2161353153 is an apocalyptic number.
161353153 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
161353153 is a deficient number, since it is larger than the sum of its proper divisors (12564647).
161353153 is a wasteful number, since it uses less digits than its factorization.
161353153 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10931.
The product of its digits is 4050, while the sum is 28.
The square root of 161353153 is about 12702.4860952492. The cubic root of 161353153 is about 544.4096550757.
The spelling of 161353153 in words is "one hundred sixty-one million, three hundred fifty-three thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •