Base | Representation |
---|---|
bin | 1001010100010000011… |
… | …1010010001100111000 |
3 | 120022010121122012021210 |
4 | 2111010013102030320 |
5 | 10110243434101300 |
6 | 201310131203120 |
7 | 14364231141411 |
oct | 2250407221470 |
9 | 508117565253 |
10 | 160056550200 |
11 | 61974828168 |
12 | 2702a7464a0 |
13 | 12129ba9591 |
14 | 7a65234808 |
15 | 426b90d050 |
hex | 25441d2338 |
160056550200 has 96 divisors (see below), whose sum is σ = 496390728960. Its totient is φ = 42663216000.
The previous prime is 160056550169. The next prime is 160056550217. The reversal of 160056550200 is 2055650061.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1353867 + ... + 1467333.
It is an arithmetic number, because the mean of its divisors is an integer number (5170736760).
Almost surely, 2160056550200 is an apocalyptic number.
160056550200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
160056550200 is an abundant number, since it is smaller than the sum of its proper divisors (336334178760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160056550200 is a wasteful number, since it uses less digits than its factorization.
160056550200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115837 (or 115828 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 160056550200 in words is "one hundred sixty billion, fifty-six million, five hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •