Base | Representation |
---|---|
bin | 10011010000110… |
… | …11001010011000 |
3 | 102021001201111102 |
4 | 21220123022120 |
5 | 312331420320 |
6 | 24011250532 |
7 | 4001336405 |
oct | 1150331230 |
9 | 367051442 |
10 | 161591960 |
11 | 8323a482 |
12 | 46149a48 |
13 | 2762a25a |
14 | 176652ac |
15 | e2be175 |
hex | 9a1b298 |
161591960 has 64 divisors (see below), whose sum is σ = 387180000. Its totient is φ = 60521472.
The previous prime is 161591929. The next prime is 161591981. The reversal of 161591960 is 69195161.
It is a happy number.
It is a super-2 number, since 2×1615919602 = 52223923073283200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 66446 + ... + 68834.
Almost surely, 2161591960 is an apocalyptic number.
161591960 is a gapful number since it is divisible by the number (10) 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 161591960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193590000).
161591960 is an abundant number, since it is smaller than the sum of its proper divisors (225588040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161591960 is a wasteful number, since it uses less digits than its factorization.
161591960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2508 (or 2504 counting only the distinct ones).
The product of its (nonzero) digits is 14580, while the sum is 38.
The square root of 161591960 is about 12711.8826300434. The cubic root of 161591960 is about 544.6781029862.
The spelling of 161591960 in words is "one hundred sixty-one million, five hundred ninety-one thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •