Base | Representation |
---|---|
bin | 1001011001111000001… |
… | …1111001000010101000 |
3 | 120110000210012101101010 |
4 | 2112132003321002220 |
5 | 10121341244011102 |
6 | 202115555423520 |
7 | 14446514012202 |
oct | 2263603710250 |
9 | 513023171333 |
10 | 161565610152 |
11 | 62579636251 |
12 | 2738bbb4ba0 |
13 | 1230a72156b |
14 | 7b69815772 |
15 | 4309146d6c |
hex | 259e0f90a8 |
161565610152 has 32 divisors (see below), whose sum is σ = 405693396000. Its totient is φ = 53617953984.
The previous prime is 161565610147. The next prime is 161565610163. The reversal of 161565610152 is 251016565161.
It is a super-2 number, since 2×1615656101522 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 161565610152.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14822527 + ... + 14833422.
It is an arithmetic number, because the mean of its divisors is an integer number (12677918625).
Almost surely, 2161565610152 is an apocalyptic number.
161565610152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
161565610152 is an abundant number, since it is smaller than the sum of its proper divisors (244127785848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161565610152 is a wasteful number, since it uses less digits than its factorization.
161565610152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29656185 (or 29656181 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 39.
The spelling of 161565610152 in words is "one hundred sixty-one billion, five hundred sixty-five million, six hundred ten thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •