Base | Representation |
---|---|
bin | 10011001110010… |
… | …00001111010001 |
3 | 102020102110120121 |
4 | 21213020033101 |
5 | 312240033210 |
6 | 24000110241 |
7 | 3665423224 |
oct | 1147101721 |
9 | 366373517 |
10 | 161252305 |
11 | 83028275 |
12 | 46005381 |
13 | 2753b786 |
14 | 175b75bb |
15 | e2536da |
hex | 99c83d1 |
161252305 has 8 divisors (see below), whose sum is σ = 193597992. Its totient is φ = 128938368.
The previous prime is 161252291. The next prime is 161252363. The reversal of 161252305 is 503252161.
It can be written as a sum of positive squares in 4 ways, for example, as 1507984 + 159744321 = 1228^2 + 12639^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 161252305 - 27 = 161252177 is a prime.
It is an alternating number because its digits alternate between odd and even.
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 161252305.
It is an unprimeable number.
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, 5227 + ... + 18703.
It is an arithmetic number, because the mean of its divisors is an integer number (24199749).
Almost surely, 2161252305 is an apocalyptic number.
It is an amenable number.
161252305 is a deficient number, since it is larger than the sum of its proper divisors (32345687).
161252305 is a wasteful number, since it uses less digits than its factorization.
161252305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15875.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 161252305 is about 12698.5158581623. The cubic root of 161252305 is about 544.2962101958.
The spelling of 161252305 in words is "one hundred sixty-one million, two hundred fifty-two thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •