Base | Representation |
---|---|
bin | 10011001101100… |
… | …01000001011101 |
3 | 102020020122010200 |
4 | 21212301001131 |
5 | 312224012323 |
6 | 23554054113 |
7 | 3664546050 |
oct | 1146610135 |
9 | 366218120 |
10 | 161157213 |
11 | 82a72888 |
12 | 45b7a339 |
13 | 275073c9 |
14 | 17590a97 |
15 | e235443 |
hex | 99b105d |
161157213 has 24 divisors (see below), whose sum is σ = 266430528. Its totient is φ = 91953792.
The previous prime is 161157197. The next prime is 161157223. The reversal of 161157213 is 312751161.
It is not a de Polignac number, because 161157213 - 24 = 161157197 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161157223) 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 23 ways as a sum of consecutive naturals, for example, 54181 + ... + 57077.
It is an arithmetic number, because the mean of its divisors is an integer number (11101272).
Almost surely, 2161157213 is an apocalyptic number.
It is an amenable number.
161157213 is a deficient number, since it is larger than the sum of its proper divisors (105273315).
161157213 is a wasteful number, since it uses less digits than its factorization.
161157213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3793 (or 3790 counting only the distinct ones).
The product of its digits is 1260, while the sum is 27.
The square root of 161157213 is about 12694.7710889169. The cubic root of 161157213 is about 544.1891969604.
The spelling of 161157213 in words is "one hundred sixty-one million, one hundred fifty-seven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •