Base | Representation |
---|---|
bin | 1001011000010010001… |
… | …0000110100001001100 |
3 | 120101220221022002120012 |
4 | 2112010202012201030 |
5 | 10120002123301220 |
6 | 202005300012352 |
7 | 14433063431651 |
oct | 2260442064114 |
9 | 511827262505 |
10 | 161137322060 |
11 | 623798aa050 |
12 | 272906910b8 |
13 | 1226ca87260 |
14 | 7b289a9c28 |
15 | 42d1746ac5 |
hex | 258488684c |
161137322060 has 96 divisors (see below), whose sum is σ = 401407598592. Its totient is φ = 53562827520.
The previous prime is 161137321979. The next prime is 161137322081. The reversal of 161137322060 is 60223731161.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21077 + ... + 568083.
It is an arithmetic number, because the mean of its divisors is an integer number (4181329152).
Almost surely, 2161137322060 is an apocalyptic number.
161137322060 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 161137322060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200703799296).
161137322060 is an abundant number, since it is smaller than the sum of its proper divisors (240270276532).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161137322060 is a wasteful number, since it uses less digits than its factorization.
161137322060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 547143 (or 547141 counting only the distinct ones).
The product of its (nonzero) digits is 9072, while the sum is 32.
The spelling of 161137322060 in words is "one hundred sixty-one billion, one hundred thirty-seven million, three hundred twenty-two thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •