Base | Representation |
---|---|
bin | 101111110010110101000010… |
… | …011111111101111110100000 |
3 | 1000120021000210210000102200112 |
4 | 233302311002133331332200 |
5 | 210022413333142010422 |
6 | 2023021020142110452 |
7 | 62163346314500552 |
oct | 5762650237757640 |
9 | 1016230723012615 |
10 | 210201110110112 |
11 | 60a818767a8740 |
12 | 1b6aa47257b428 |
13 | 9039b58716c54 |
14 | 39c9b064454d2 |
15 | 1947c2eb37ee2 |
hex | bf2d427fdfa0 |
210201110110112 has 96 divisors (see below), whose sum is σ = 476958699544320. Its totient is φ = 90288477690880.
The previous prime is 210201110110073. The next prime is 210201110110217. The reversal of 210201110110112 is 211011011102012.
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 15 ways as a sum of consecutive naturals, for example, 218581943 + ... + 219541494.
It is an arithmetic number, because the mean of its divisors is an integer number (4968319786920).
Almost surely, 2210201110110112 is an apocalyptic number.
210201110110112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
210201110110112 is an abundant number, since it is smaller than the sum of its proper divisors (266757589434208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
210201110110112 is a wasteful number, since it uses less digits than its factorization.
210201110110112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 438123534 (or 438123526 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 210201110110112 its reverse (211011011102012), we get a palindrome (421212121212124).
The spelling of 210201110110112 in words is "two hundred ten trillion, two hundred one billion, one hundred ten million, one hundred ten thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •