Base | Representation |
---|---|
bin | 1001100011001111010100… |
… | …00100010111001001111111 |
3 | 2202100202220000212101012022 |
4 | 10301213222010113021333 |
5 | 10223044120130401421 |
6 | 112400110141430355 |
7 | 4265226454360442 |
oct | 461475204271177 |
9 | 82322800771168 |
10 | 21002022122111 |
11 | 67679a8a6a228 |
12 | 24323ba86b3bb |
13 | b946364a0c24 |
14 | 52870907b659 |
15 | 26649ddce7ab |
hex | 1319ea11727f |
21002022122111 has 4 divisors (see below), whose sum is σ = 21448873656672. Its totient is φ = 20555170587552.
The previous prime is 21002022122063. The next prime is 21002022122113. The reversal of 21002022122111 is 11122122020012.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21002022122111 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 21002022122111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21002022122113) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 223425767210 + ... + 223425767303.
It is an arithmetic number, because the mean of its divisors is an integer number (5362218414168).
Almost surely, 221002022122111 is an apocalyptic number.
21002022122111 is a deficient number, since it is larger than the sum of its proper divisors (446851534561).
21002022122111 is an equidigital number, since it uses as much as digits as its factorization.
21002022122111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 446851534560.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 21002022122111 its reverse (11122122020012), we get a palindrome (32124144142123).
The spelling of 21002022122111 in words is "twenty-one trillion, two billion, twenty-two million, one hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •