Base | Representation |
---|---|
bin | 1001100011001011111100… |
… | …00011101010100011101111 |
3 | 2202100121012202001001010200 |
4 | 10301211332003222203233 |
5 | 10223031412230000421 |
6 | 112355210245404543 |
7 | 4265133531525066 |
oct | 461457603524357 |
9 | 82317182031120 |
10 | 21000210000111 |
11 | 6767159086141 |
12 | 2431b93a09753 |
13 | b94407c284a4 |
14 | 5285b652b1dd |
15 | 2663e4c7e726 |
hex | 13197e0ea8ef |
21000210000111 has 24 divisors (see below), whose sum is σ = 30426582279600. Its totient is φ = 13957260320256.
The previous prime is 21000210000101. The next prime is 21000210000113. The reversal of 21000210000111 is 11100001200012.
It is a happy number.
It is not a de Polignac number, because 21000210000111 - 29 = 21000209999599 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 = 21000210000093 and 21000210000102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21000210000113) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 13056820 + ... + 14576726.
It is an arithmetic number, because the mean of its divisors is an integer number (1267774261650).
Almost surely, 221000210000111 is an apocalyptic number.
21000210000111 is a deficient number, since it is larger than the sum of its proper divisors (9426372279489).
21000210000111 is a wasteful number, since it uses less digits than its factorization.
21000210000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1524615 (or 1524612 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 21000210000111 its reverse (11100001200012), we get a palindrome (32100211200123).
The spelling of 21000210000111 in words is "twenty-one trillion, two hundred ten million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •