Base | Representation |
---|---|
bin | 11101001000100110011… |
… | …101011001100111000101 |
3 | 21002101202210100222002002 |
4 | 131020212131121213011 |
5 | 230300300100014341 |
6 | 4131430235155045 |
7 | 264434622135425 |
oct | 35104635314705 |
9 | 7071683328062 |
10 | 2002100001221 |
11 | 7020a428a891 |
12 | 28402b2a5a85 |
13 | 116a49652948 |
14 | 6cc8b73a485 |
15 | 3712c54529b |
hex | 1d2267599c5 |
2002100001221 has 4 divisors (see below), whose sum is σ = 2013672833772. Its totient is φ = 1990527168672.
The previous prime is 2002100001203. The next prime is 2002100001259. The reversal of 2002100001221 is 1221000012002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1195895344900 + 806204656321 = 1093570^2 + 897889^2 .
It is a cyclic number.
It is not a de Polignac number, because 2002100001221 - 26 = 2002100001157 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2002100001521) 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, 5786416016 + ... + 5786416361.
It is an arithmetic number, because the mean of its divisors is an integer number (503418208443).
Almost surely, 22002100001221 is an apocalyptic number.
It is an amenable number.
2002100001221 is a deficient number, since it is larger than the sum of its proper divisors (11572832551).
2002100001221 is a wasteful number, since it uses less digits than its factorization.
2002100001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11572832550.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2002100001221 its reverse (1221000012002), we get a palindrome (3223100013223).
The spelling of 2002100001221 in words is "two trillion, two billion, one hundred million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •