Base | Representation |
---|---|
bin | 10011001101000… |
… | …10010000001011 |
3 | 102020010120011000 |
4 | 21212202100023 |
5 | 312220043330 |
6 | 23552510043 |
7 | 3664204503 |
oct | 1146422013 |
9 | 366116130 |
10 | 161096715 |
11 | 82a3138a |
12 | 45b4b323 |
13 | 274b5a00 |
14 | 17576a03 |
15 | e222560 |
hex | 99a240b |
161096715 has 96 divisors (see below), whose sum is σ = 324656640. Its totient is φ = 75613824.
The previous prime is 161096713. The next prime is 161096723. The reversal of 161096715 is 517690161.
It is a happy number.
It is not a de Polignac number, because 161096715 - 21 = 161096713 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 161096715.
It is not an unprimeable number, because it can be changed into a prime (161096713) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 524592 + ... + 524898.
It is an arithmetic number, because the mean of its divisors is an integer number (3381840).
Almost surely, 2161096715 is an apocalyptic number.
161096715 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
161096715 is an abundant number, since it is smaller than the sum of its proper divisors (163559925).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161096715 is a wasteful number, since it uses less digits than its factorization.
161096715 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 370 (or 351 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 36.
The square root of 161096715 is about 12692.3880731720. The cubic root of 161096715 is about 544.1210926996.
The spelling of 161096715 in words is "one hundred sixty-one million, ninety-six thousand, seven hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •