Base | Representation |
---|---|
bin | 1001011010000001111… |
… | …0011000110101100000 |
3 | 120110010121102000111020 |
4 | 2112200132120311200 |
5 | 10121432131014220 |
6 | 202124003445440 |
7 | 14450515163166 |
oct | 2264036306540 |
9 | 513117360436 |
10 | 161606110560 |
11 | 6259a488864 |
12 | 273a1686880 |
13 | 12315c31abb |
14 | 7b70d59236 |
15 | 430c997040 |
hex | 25a0798d60 |
161606110560 has 48 divisors (see below), whose sum is σ = 509059249776. Its totient is φ = 43094962688.
The previous prime is 161606110543. The next prime is 161606110577. The reversal of 161606110560 is 65011606161.
It is an interprime number because it is at equal distance from previous prime (161606110543) and next prime (161606110577).
It is a tau number, because it is divible by the number of its divisors (48).
It is a super-2 number, since 2×1616061105602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 168339219 + ... + 168340178.
It is an arithmetic number, because the mean of its divisors is an integer number (10605401037).
Almost surely, 2161606110560 is an apocalyptic number.
161606110560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
161606110560 is an abundant number, since it is smaller than the sum of its proper divisors (347453139216).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161606110560 is a wasteful number, since it uses less digits than its factorization.
161606110560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336679415 (or 336679407 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The spelling of 161606110560 in words is "one hundred sixty-one billion, six hundred six million, one hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •