Base | Representation |
---|---|
bin | 1001011000010101010… |
… | …0100111101110000100 |
3 | 120101221212012220210210 |
4 | 2112011110213232010 |
5 | 10120014021042002 |
6 | 202010451515420 |
7 | 14433314126565 |
oct | 2260524475604 |
9 | 511855186723 |
10 | 161150565252 |
11 | 62386324936 |
12 | 27294bb8b70 |
13 | 12272743071 |
14 | 7b2a65616c |
15 | 42d29b096c |
hex | 2585527b84 |
161150565252 has 48 divisors (see below), whose sum is σ = 385345497152. Its totient is φ = 52388138880.
The previous prime is 161150565223. The next prime is 161150565283. The reversal of 161150565252 is 252565051161.
It is a self number, because there is not a number n which added to its sum of digits gives 161150565252.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 104838 + ... + 577314.
Almost surely, 2161150565252 is an apocalyptic number.
161150565252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
161150565252 is an abundant number, since it is smaller than the sum of its proper divisors (224194931900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161150565252 is a wasteful number, since it uses less digits than its factorization.
161150565252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 473188 (or 473186 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 39.
The spelling of 161150565252 in words is "one hundred sixty-one billion, one hundred fifty million, five hundred sixty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •