Base | Representation |
---|---|
bin | 11101001000100111000… |
… | …011111101101000001101 |
3 | 21002101210111101120000111 |
4 | 131020213003331220031 |
5 | 230300310142011341 |
6 | 4131431240000021 |
7 | 264435104100634 |
oct | 35104703755015 |
9 | 7071714346014 |
10 | 2002110110221 |
11 | 7020a9a64931 |
12 | 284032760011 |
13 | 116a4b781cc0 |
14 | 6cc8cc0c51b |
15 | 3712d390681 |
hex | 1d2270fda0d |
2002110110221 has 8 divisors (see below), whose sum is σ = 2196800063640. Its totient is φ = 1813231797312.
The previous prime is 2002110110219. The next prime is 2002110110239. The reversal of 2002110110221 is 1220110112002.
It can be written as a sum of positive squares in 4 ways, for example, as 45997380900 + 1956112729321 = 214470^2 + 1398611^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2002110110221 - 21 = 2002110110219 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002110110261) 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, 1452909406 + ... + 1452910783.
It is an arithmetic number, because the mean of its divisors is an integer number (274600007955).
Almost surely, 22002110110221 is an apocalyptic number.
It is an amenable number.
2002110110221 is a deficient number, since it is larger than the sum of its proper divisors (194689953419).
2002110110221 is a wasteful number, since it uses less digits than its factorization.
2002110110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2905820255.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2002110110221 its reverse (1220110112002), we get a palindrome (3222220222223).
The spelling of 2002110110221 in words is "two trillion, two billion, one hundred ten million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •