Base | Representation |
---|---|
bin | 10011001100110… |
… | …01101011101111 |
3 | 102020001210000000 |
4 | 21212121223233 |
5 | 312212432430 |
6 | 23552035343 |
7 | 3664000251 |
oct | 1146315357 |
9 | 366053000 |
10 | 161061615 |
11 | 82a07a80 |
12 | 45b32b53 |
13 | 274a2a40 |
14 | 17567cd1 |
15 | e216e60 |
hex | 9999aef |
161061615 has 128 divisors (see below), whose sum is σ = 343848960. Its totient is φ = 71383680.
The previous prime is 161061599. The next prime is 161061619. The reversal of 161061615 is 516160161.
It is not a de Polignac number, because 161061615 - 24 = 161061599 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a plaindrome in base 16.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (161061619) by changing a digit.
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 127 ways as a sum of consecutive naturals, for example, 1563654 + ... + 1563756.
It is an arithmetic number, because the mean of its divisors is an integer number (2686320).
Almost surely, 2161061615 is an apocalyptic number.
161061615 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
161061615 is an abundant number, since it is smaller than the sum of its proper divisors (182787345).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161061615 is a wasteful number, since it uses less digits than its factorization.
161061615 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153 (or 135 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 27.
The square root of 161061615 is about 12691.0052793307. The cubic root of 161061615 is about 544.0815718491.
The spelling of 161061615 in words is "one hundred sixty-one million, sixty-one thousand, six hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •