Base | Representation |
---|---|
bin | 11101000110101001010… |
… | …010111111100110000101 |
3 | 21002012100110002000020202 |
4 | 131012221102333212011 |
5 | 230232000012334341 |
6 | 4130442023340245 |
7 | 264331603351334 |
oct | 35065122774605 |
9 | 7065313060222 |
10 | 2000000121221 |
11 | 701216a23973 |
12 | 283743bb1685 |
13 | 1167a35a75bb |
14 | 6cb2c8c1d1b |
15 | 3705800379b |
hex | 1d1a94bf985 |
2000000121221 has 4 divisors (see below), whose sum is σ = 2017699237452. Its totient is φ = 1982301004992.
The previous prime is 2000000121169. The next prime is 2000000121307. The reversal of 2000000121221 is 1221210000002.
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 368285128225 + 1631714992996 = 606865^2 + 1277386^2 .
It is a cyclic number.
It is not a de Polignac number, because 2000000121221 - 222 = 1999995926917 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 (2000000121121) 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, 8849557946 + ... + 8849558171.
It is an arithmetic number, because the mean of its divisors is an integer number (504424809363).
Almost surely, 22000000121221 is an apocalyptic number.
It is an amenable number.
2000000121221 is a deficient number, since it is larger than the sum of its proper divisors (17699116231).
2000000121221 is a wasteful number, since it uses less digits than its factorization.
2000000121221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17699116230.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 2000000121221 its reverse (1221210000002), we get a palindrome (3221210121223).
The spelling of 2000000121221 in words is "two trillion, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •