Base | Representation |
---|---|
bin | 1001100011110001000000… |
… | …01100001011011011111111 |
3 | 2202102111120121102021220002 |
4 | 10301320200030023123333 |
5 | 10223343141130310421 |
6 | 112412301043544515 |
7 | 4266436631031002 |
oct | 461704014133377 |
9 | 82374517367802 |
10 | 21020110010111 |
11 | 67746401201a3 |
12 | 2435a0838b13b |
13 | b96259994034 |
14 | 529543425539 |
15 | 266babd48b0b |
hex | 131e2030b6ff |
21020110010111 has 16 divisors (see below), whose sum is σ = 22252549925760. Its totient is φ = 19821591790560.
The previous prime is 21020110010099. The next prime is 21020110010171. The reversal of 21020110010111 is 11101001102012.
It is a cyclic number.
It is not a de Polignac number, because 21020110010111 - 26 = 21020110010047 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 21020110010092 and 21020110010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020110010171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13910096 + ... + 15347018.
It is an arithmetic number, because the mean of its divisors is an integer number (1390784370360).
Almost surely, 221020110010111 is an apocalyptic number.
21020110010111 is a deficient number, since it is larger than the sum of its proper divisors (1232439915649).
21020110010111 is a wasteful number, since it uses less digits than its factorization.
21020110010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1448726.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 21020110010111 its reverse (11101001102012), we get a palindrome (32121111112123).
The spelling of 21020110010111 in words is "twenty-one trillion, twenty billion, one hundred ten million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •