Base | Representation |
---|---|
bin | 1100001110011000101… |
… | …1100001100110100111 |
3 | 202002002200002011001110 |
4 | 3003212023201212213 |
5 | 11420110133223421 |
6 | 240252034000103 |
7 | 21113332224324 |
oct | 3034613414647 |
9 | 662080064043 |
10 | 210020211111 |
11 | 81083a30107 |
12 | 34853416033 |
13 | 16a60264b89 |
14 | a244bc5b4b |
15 | 56e2ec5a76 |
hex | 30e62e19a7 |
210020211111 has 8 divisors (see below), whose sum is σ = 280066092160. Its totient is φ = 139993902072.
The previous prime is 210020211097. The next prime is 210020211127. The reversal of 210020211111 is 111112020012.
210020211111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210020211111 - 213 = 210020202919 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (210020211211) 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, 4867945 + ... + 4910898.
It is an arithmetic number, because the mean of its divisors is an integer number (35008261520).
Almost surely, 2210020211111 is an apocalyptic number.
210020211111 is a deficient number, since it is larger than the sum of its proper divisors (70045881049).
210020211111 is an equidigital number, since it uses as much as digits as its factorization.
210020211111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9786005.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 210020211111 its reverse (111112020012), we get a palindrome (321132231123).
The spelling of 210020211111 in words is "two hundred ten billion, twenty million, two hundred eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •