Base | Representation |
---|---|
bin | 1001100011100010010011… |
… | …11010100110110011101111 |
3 | 2202101202012202011221112122 |
4 | 10301301021322212303233 |
5 | 10223231011322041421 |
6 | 112404514120023155 |
7 | 4266040255015634 |
oct | 461611172466357 |
9 | 82352182157478 |
10 | 21012220112111 |
11 | 6771261514038 |
12 | 2434386001abb |
13 | b955a01c0837 |
14 | 528dd561c18b |
15 | 26689934b2ab |
hex | 131c49ea6cef |
21012220112111 has 8 divisors (see below), whose sum is σ = 21698132145360. Its totient is φ = 20335274249472.
The previous prime is 21012220112071. The next prime is 21012220112183. The reversal of 21012220112111 is 11121102221012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21012220112111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 21012220112111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21012220112911) 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, 2241537890 + ... + 2241547263.
It is an arithmetic number, because the mean of its divisors is an integer number (2712266518170).
Almost surely, 221012220112111 is an apocalyptic number.
21012220112111 is a deficient number, since it is larger than the sum of its proper divisors (685912033249).
21012220112111 is a wasteful number, since it uses less digits than its factorization.
21012220112111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4483085305.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 21012220112111 its reverse (11121102221012), we get a palindrome (32133322333123).
The spelling of 21012220112111 in words is "twenty-one trillion, twelve billion, two hundred twenty million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •