Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …010001111101011101001 |
3 | 21002012100120122120210110 |
4 | 131012221122033223221 |
5 | 230232001004201441 |
6 | 4130442132204533 |
7 | 264331625456325 |
oct | 35065132175351 |
9 | 7065316576713 |
10 | 2000002022121 |
11 | 701218002064 |
12 | 283744769749 |
13 | 1167a3ac18ac |
14 | 6cb2cc58985 |
15 | 3705827bb16 |
hex | 1d1a968fae9 |
2000002022121 has 8 divisors (see below), whose sum is σ = 2666749315360. Its totient is φ = 1333294705152.
The previous prime is 2000002022071. The next prime is 2000002022167. The reversal of 2000002022121 is 1212202000002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2000002022121 - 27 = 2000002021993 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2000002022097 and 2000002022106.
It is not an unprimeable number, because it can be changed into a prime (2000002022191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9877135 + ... + 10077588.
It is an arithmetic number, because the mean of its divisors is an integer number (333343664420).
Almost surely, 22000002022121 is an apocalyptic number.
It is an amenable number.
2000002022121 is a deficient number, since it is larger than the sum of its proper divisors (666747293239).
2000002022121 is a wasteful number, since it uses less digits than its factorization.
2000002022121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19988135.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 2000002022121 its reverse (1212202000002), we get a palindrome (3212204022123).
The spelling of 2000002022121 in words is "two trillion, two million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •