Base | Representation |
---|---|
bin | 101111110010110101000111… |
… | …111110111010111000110000 |
3 | 1000120021001001012010111210210 |
4 | 233302311013332322320300 |
5 | 210022414030220010000 |
6 | 2023021033230024120 |
7 | 62163351512463033 |
oct | 5762650776727060 |
9 | 1016231035114723 |
10 | 210201202110000 |
11 | 60a81913725602 |
12 | 1b6aa499348040 |
13 | 9039b717b925a |
14 | 39c9b1475301a |
15 | 1947c37c5c350 |
hex | bf2d47fbae30 |
210201202110000 has 200 divisors, whose sum is σ = 685145454273280. Its totient is φ = 55509442848000.
The previous prime is 210201202109993. The next prime is 210201202110113. The reversal of 210201202110000 is 11202102012.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 30923140 + ... + 37103139.
Almost surely, 2210201202110000 is an apocalyptic number.
210201202110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
210201202110000 is an abundant number, since it is smaller than the sum of its proper divisors (474944252163280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201202110000 is a wasteful number, since it uses less digits than its factorization.
210201202110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68026413 (or 68026392 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 210201202110000 its reverse (11202102012), we get a palindrome (210212404212012).
The spelling of 210201202110000 in words is "two hundred ten trillion, two hundred one billion, two hundred two million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •