Base | Representation |
---|---|
bin | 10011001111000… |
… | …10110000111000 |
3 | 102020121222121120 |
4 | 21213202300320 |
5 | 312302022302 |
6 | 24002305240 |
7 | 3666355044 |
oct | 1147426070 |
9 | 366558546 |
10 | 161360952 |
11 | 830a1965 |
12 | 46058220 |
13 | 2757906c |
14 | 17605024 |
15 | e2759bc |
hex | 99e2c38 |
161360952 has 64 divisors (see below), whose sum is σ = 422261760. Its totient is φ = 51321600.
The previous prime is 161360869. The next prime is 161360963. The reversal of 161360952 is 259063161.
It is a happy number.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 52827 + ... + 55797.
It is an arithmetic number, because the mean of its divisors is an integer number (6597840).
Almost surely, 2161360952 is an apocalyptic number.
161360952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 161360952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211130880).
161360952 is an abundant number, since it is smaller than the sum of its proper divisors (260900808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161360952 is a wasteful number, since it uses less digits than its factorization.
161360952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3084 (or 3080 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 33.
The square root of 161360952 is about 12702.7930786894. The cubic root of 161360952 is about 544.4184262760.
The spelling of 161360952 in words is "one hundred sixty-one million, three hundred sixty thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •