Base | Representation |
---|---|
bin | 1100010001011110100… |
… | …1101100110110011000 |
3 | 202011020111212012201211 |
4 | 3010113221230312120 |
5 | 11423310123030310 |
6 | 240510243352504 |
7 | 21143031112654 |
oct | 3042751546630 |
9 | 664214765654 |
10 | 210850205080 |
11 | 8146a497939 |
12 | 34a45382734 |
13 | 16b631ba078 |
14 | a2c311ba64 |
15 | 5740cc4c8a |
hex | 3117a6cd98 |
210850205080 has 32 divisors (see below), whose sum is σ = 502319607840. Its totient is φ = 79378900480.
The previous prime is 210850205077. The next prime is 210850205081. The reversal of 210850205080 is 80502058012.
210850205080 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210850205081) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 155036236 + ... + 155037595.
It is an arithmetic number, because the mean of its divisors is an integer number (15697487745).
Almost surely, 2210850205080 is an apocalyptic number.
210850205080 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210850205080 is an abundant number, since it is smaller than the sum of its proper divisors (291469402760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210850205080 is a wasteful number, since it uses less digits than its factorization.
210850205080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 310073859 (or 310073855 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 31.
The spelling of 210850205080 in words is "two hundred ten billion, eight hundred fifty million, two hundred five thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •