Base | Representation |
---|---|
bin | 1001100011110000110100… |
… | …01110101010111011101111 |
3 | 2202102111022122020020222000 |
4 | 10301320122032222323233 |
5 | 10223342440030000421 |
6 | 112412243112223343 |
7 | 4266434304664443 |
oct | 461703216527357 |
9 | 82374278206860 |
10 | 21020010000111 |
11 | 6774599722201 |
12 | 243599a99ab53 |
13 | b96242048b15 |
14 | 529534030823 |
15 | 266ba3191226 |
hex | 131e1a3aaeef |
21020010000111 has 16 divisors (see below), whose sum is σ = 31142193268320. Its totient is φ = 14012693029440.
The previous prime is 21020010000107. The next prime is 21020010000133. The reversal of 21020010000111 is 11100001002012.
It is a happy number.
It is not a de Polignac number, because 21020010000111 - 22 = 21020010000107 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 21020010000093 and 21020010000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21020010040111) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17375400 + ... + 18545741.
It is an arithmetic number, because the mean of its divisors is an integer number (1946387079270).
Almost surely, 221020010000111 is an apocalyptic number.
21020010000111 is a deficient number, since it is larger than the sum of its proper divisors (10122183268209).
21020010000111 is a wasteful number, since it uses less digits than its factorization.
21020010000111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35942823 (or 35942817 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 21020010000111 its reverse (11100001002012), we get a palindrome (32120011002123).
The spelling of 21020010000111 in words is "twenty-one trillion, twenty billion, ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •