Base | Representation |
---|---|
bin | 1001010111110010101… |
… | …1011110001010110100 |
3 | 120101120202100220200102 |
4 | 2111330223132022310 |
5 | 10114214410414000 |
6 | 201544231533232 |
7 | 14426603453321 |
oct | 2257453361264 |
9 | 511522326612 |
10 | 161005560500 |
11 | 623114946a4 |
12 | 2725452a218 |
13 | 1224b6a2a35 |
14 | 7b152abb48 |
15 | 42c4dbb3d5 |
hex | 257cade2b4 |
161005560500 has 48 divisors (see below), whose sum is σ = 352112779200. Its totient is φ = 64314928800.
The previous prime is 161005560431. The next prime is 161005560553. The reversal of 161005560500 is 5065500161.
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, 151631 + ... + 587369.
It is an arithmetic number, because the mean of its divisors is an integer number (7335682900).
Almost surely, 2161005560500 is an apocalyptic number.
161005560500 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 161005560500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (176056389600).
161005560500 is an abundant number, since it is smaller than the sum of its proper divisors (191107218700).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
161005560500 is a wasteful number, since it uses less digits than its factorization.
161005560500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436497 (or 436485 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 161005560500 in words is "one hundred sixty-one billion, five million, five hundred sixty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •