Base | Representation |
---|---|
bin | 1100001110101110001… |
… | …0011101110100100100 |
3 | 202002022221020112112102 |
4 | 3003223202131310210 |
5 | 11420301142023022 |
6 | 240305004511232 |
7 | 21115503322214 |
oct | 3035342356444 |
9 | 662287215472 |
10 | 210110111012 |
11 | 8111a75324a |
12 | 3487954b518 |
13 | 16a75a80399 |
14 | a252b08244 |
15 | 56ead32a92 |
hex | 30eb89dd24 |
210110111012 has 6 divisors (see below), whose sum is σ = 367692694278. Its totient is φ = 105055055504.
The previous prime is 210110111009. The next prime is 210110111051. The reversal of 210110111012 is 210111011012.
210110111012 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 209200123456 + 909987556 = 457384^2 + 30166^2 .
It is a junction number, because it is equal to n+sod(n) for n = 210110110984 and 210110111002.
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 as a sum of consecutive naturals, namely, 26263763873 + ... + 26263763880.
It is an arithmetic number, because the mean of its divisors is an integer number (61282115713).
Almost surely, 2210110111012 is an apocalyptic number.
It is an amenable number.
210110111012 is a deficient number, since it is larger than the sum of its proper divisors (157582583266).
210110111012 is a wasteful number, since it uses less digits than its factorization.
210110111012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52527527757 (or 52527527755 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 210110111012 its reverse (210111011012), we get a palindrome (420221122024).
The spelling of 210110111012 in words is "two hundred ten billion, one hundred ten million, one hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •