Base | Representation |
---|---|
bin | 10011000101000… |
… | …11011100001000 |
3 | 102011011112102220 |
4 | 21202203130020 |
5 | 311433144000 |
6 | 23514254040 |
7 | 3652266552 |
oct | 1142433410 |
9 | 364145386 |
10 | 160053000 |
11 | 82389208 |
12 | 45727320 |
13 | 2720b923 |
14 | 173844d2 |
15 | e0b81a0 |
hex | 98a3708 |
160053000 has 128 divisors (see below), whose sum is σ = 515773440. Its totient is φ = 41280000.
The previous prime is 160052999. The next prime is 160053041. The reversal of 160053000 is 350061.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 92140 + ... + 93860.
It is an arithmetic number, because the mean of its divisors is an integer number (4029480).
Almost surely, 2160053000 is an apocalyptic number.
160053000 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 160053000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (257886720).
160053000 is an abundant number, since it is smaller than the sum of its proper divisors (355720440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
160053000 is a wasteful number, since it uses less digits than its factorization.
160053000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1776 (or 1762 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 15.
The square root of 160053000 is about 12651.2054761592. The cubic root of 160053000 is about 542.9434600905.
The spelling of 160053000 in words is "one hundred sixty million, fifty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •