Base | Representation |
---|---|
bin | 1001100011011110011000… |
… | …01101011100001011101111 |
3 | 2202101112202202202001101211 |
4 | 10301233030031130023233 |
5 | 10223212201421320421 |
6 | 112403524541015251 |
7 | 4265634065621131 |
oct | 461571415341357 |
9 | 82345682661354 |
10 | 21010111120111 |
11 | 6770379aa4143 |
12 | 2433a97854527 |
13 | b953252a4b89 |
14 | 528c754b1051 |
15 | 2667c41099e1 |
hex | 131bcc35c2ef |
21010111120111 has 8 divisors (see below), whose sum is σ = 21265597617264. Its totient is φ = 20754680638080.
The previous prime is 21010111120057. The next prime is 21010111120129. The reversal of 21010111120111 is 11102111101012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 21010111120111 - 27 = 21010111119983 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21010111120091 and 21010111120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21010111120181) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13248816 + ... + 14749621.
It is an arithmetic number, because the mean of its divisors is an integer number (2658199702158).
Almost surely, 221010111120111 is an apocalyptic number.
21010111120111 is a deficient number, since it is larger than the sum of its proper divisors (255486497153).
21010111120111 is an equidigital number, since it uses as much as digits as its factorization.
21010111120111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28007561.
The product of its (nonzero) digits is 4, while the sum is 13.
Adding to 21010111120111 its reverse (11102111101012), we get a palindrome (32112222221123).
The spelling of 21010111120111 in words is "twenty-one trillion, ten billion, one hundred eleven million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •