Base | Representation |
---|---|
bin | 10111011011011110110… |
… | …010101101101100001000 |
3 | 12200220211112200010211002 |
4 | 113123132302231230020 |
5 | 202334343213330000 |
6 | 3231352131154132 |
7 | 224215451556503 |
oct | 27333662555410 |
9 | 5626745603732 |
10 | 1610055605000 |
11 | 570903462347 |
12 | 220058445948 |
13 | b8a9b2b1b7b |
14 | 57cd9da613a |
15 | 2bd342c78d5 |
hex | 176decadb08 |
1610055605000 has 80 divisors (see below), whose sum is σ = 3777473634000. Its totient is φ = 643149288000.
The previous prime is 1610055604999. The next prime is 1610055605017. The reversal of 1610055605000 is 5065500161.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 3477131 + ... + 3912869.
It is an arithmetic number, because the mean of its divisors is an integer number (47218420425).
Almost surely, 21610055605000 is an apocalyptic number.
1610055605000 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 1610055605000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1888736817000).
1610055605000 is an abundant number, since it is smaller than the sum of its proper divisors (2167418029000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1610055605000 is an equidigital number, since it uses as much as digits as its factorization.
1610055605000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 436504 (or 436485 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 1610055605000 in words is "one trillion, six hundred ten billion, fifty-five million, six hundred five thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •