Base | Representation |
---|---|
bin | 1001100011011110100011… |
… | …00100010101111110111111 |
3 | 2202101120000000212221022002 |
4 | 10301233101210111332333 |
5 | 10223212342424310421 |
6 | 112403541511412515 |
7 | 4265636236645115 |
oct | 461572144257677 |
9 | 82346000787262 |
10 | 21010201010111 |
11 | 677041580a8a5 |
12 | 2433b0198413b |
13 | b9533aab8a21 |
14 | 528c833cdab5 |
15 | 2667cbe63b0b |
hex | 131bd1915fbf |
21010201010111 has 4 divisors (see below), whose sum is σ = 21687949429824. Its totient is φ = 20332452590400.
The previous prime is 21010201010047. The next prime is 21010201010147. The reversal of 21010201010111 is 11101010201012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 21010201010111 - 26 = 21010201010047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010201010092 and 21010201010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010201010171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 338874209810 + ... + 338874209871.
It is an arithmetic number, because the mean of its divisors is an integer number (5421987357456).
Almost surely, 221010201010111 is an apocalyptic number.
21010201010111 is a deficient number, since it is larger than the sum of its proper divisors (677748419713).
21010201010111 is an equidigital number, since it uses as much as digits as its factorization.
21010201010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 677748419712.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21010201010111 its reverse (11101010201012), we get a palindrome (32111211211123).
The spelling of 21010201010111 in words is "twenty-one trillion, ten billion, two hundred one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •