Base | Representation |
---|---|
bin | 11101001000100001000… |
… | …110111010101000110111 |
3 | 21002101112112102122220211 |
4 | 131020201012322220313 |
5 | 230300104104033421 |
6 | 4131413311010251 |
7 | 264432452050015 |
oct | 35104106725067 |
9 | 7071475378824 |
10 | 2002010221111 |
11 | 70205863974a |
12 | 284005209987 |
13 | 116a33b79b14 |
14 | 6cc7d8498b5 |
15 | 3712470d9e1 |
hex | 1d2211baa37 |
2002010221111 has 16 divisors (see below), whose sum is σ = 2126309253120. Its totient is φ = 1880872232800.
The previous prime is 2002010221103. The next prime is 2002010221139. The reversal of 2002010221111 is 1111220102002.
It is not a de Polignac number, because 2002010221111 - 23 = 2002010221103 is a prime.
It is a super-4 number, since 4×20020102211114 (a number of 50 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2002010221091 and 2002010221100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002010221181) 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, 921021 + ... + 2202793.
It is an arithmetic number, because the mean of its divisors is an integer number (132894328320).
Almost surely, 22002010221111 is an apocalyptic number.
2002010221111 is a deficient number, since it is larger than the sum of its proper divisors (124299032009).
2002010221111 is a wasteful number, since it uses less digits than its factorization.
2002010221111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1283006.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2002010221111 its reverse (1111220102002), we get a palindrome (3113230323113).
The spelling of 2002010221111 in words is "two trillion, two billion, ten million, two hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •