Base | Representation |
---|---|
bin | 1100001110101110001… |
… | …0111000101011010100 |
3 | 202002022221110010102111 |
4 | 3003223202320223110 |
5 | 11420301204033022 |
6 | 240305011120404 |
7 | 21115504261006 |
oct | 3035342705324 |
9 | 662287403374 |
10 | 210110221012 |
11 | 8111a81895a |
12 | 348795a3104 |
13 | 16a75abb483 |
14 | a252b36376 |
15 | 56ead55477 |
hex | 30eb8b8ad4 |
210110221012 has 12 divisors (see below), whose sum is σ = 369894641760. Its totient is φ = 104426037656.
The previous prime is 210110220961. The next prime is 210110221021. The reversal of 210110221012 is 210122011012.
210110221012 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2101102210122 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 210110220983 and 210110221001.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 157267462 + ... + 157268797.
It is an arithmetic number, because the mean of its divisors is an integer number (30824553480).
Almost surely, 2210110221012 is an apocalyptic number.
It is an amenable number.
210110221012 is a deficient number, since it is larger than the sum of its proper divisors (159784420748).
210110221012 is a wasteful number, since it uses less digits than its factorization.
210110221012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 314536430 (or 314536428 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 210110221012 its reverse (210122011012), we get a palindrome (420232232024).
The spelling of 210110221012 in words is "two hundred ten billion, one hundred ten million, two hundred twenty-one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •