Base | Representation |
---|---|
bin | 1001011000010001001… |
… | …1110111100000100000 |
3 | 120101220200021111220111 |
4 | 2112010103313200200 |
5 | 10120000144344220 |
6 | 202005044021104 |
7 | 14433016630645 |
oct | 2260423674040 |
9 | 511820244814 |
10 | 161133590560 |
11 | 62377790568 |
12 | 2728b391794 |
13 | 1226c07b977 |
14 | 7b282b7dcc |
15 | 42d125b15a |
hex | 25844f7820 |
161133590560 has 48 divisors (see below), whose sum is σ = 392958058752. Its totient is φ = 62374291200.
The previous prime is 161133590557. The next prime is 161133590573. The reversal of 161133590560 is 65095331161.
It is a super-2 number, since 2×1611335905602 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
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, 16238346 + ... + 16248265.
It is an arithmetic number, because the mean of its divisors is an integer number (8186626224).
Almost surely, 2161133590560 is an apocalyptic number.
161133590560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
161133590560 is an abundant number, since it is smaller than the sum of its proper divisors (231824468192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161133590560 is a wasteful number, since it uses less digits than its factorization.
161133590560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32486657 (or 32486649 counting only the distinct ones).
The product of its (nonzero) digits is 72900, while the sum is 40.
The spelling of 161133590560 in words is "one hundred sixty-one billion, one hundred thirty-three million, five hundred ninety thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.199 sec. • engine limits •