Base | Representation |
---|---|
bin | 1001000110101010100100… |
… | …01011001001100011110111 |
3 | 2121212220200122020222012222 |
4 | 10203111102023021203313 |
5 | 10111002403113033421 |
6 | 110325055045032555 |
7 | 4134261513406166 |
oct | 443252213114367 |
9 | 77786618228188 |
10 | 20020221221111 |
11 | 6419589a53821 |
12 | 22b40776b575b |
13 | b22b8b765b27 |
14 | 4d2daba8b3dd |
15 | 24ab8a24dcab |
hex | 1235522c98f7 |
20020221221111 has 4 divisors (see below), whose sum is σ = 20055781117272. Its totient is φ = 19984661324952.
The previous prime is 20020221221081. The next prime is 20020221221113. The reversal of 20020221221111 is 11112212202002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20020221221111 - 214 = 20020221204727 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 20020221221111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20020221221113) 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, 17779947236 + ... + 17779948361.
It is an arithmetic number, because the mean of its divisors is an integer number (5013945279318).
Almost surely, 220020221221111 is an apocalyptic number.
20020221221111 is a deficient number, since it is larger than the sum of its proper divisors (35559896161).
20020221221111 is an equidigital number, since it uses as much as digits as its factorization.
20020221221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35559896160.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20020221221111 its reverse (11112212202002), we get a palindrome (31132433423113).
The spelling of 20020221221111 in words is "twenty trillion, twenty billion, two hundred twenty-one million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •