Base | Representation |
---|---|
bin | 100000010101100110101… |
… | …100011100110000111101 |
3 | 21212102221101220022200102 |
4 | 200111212230130300331 |
5 | 242402102040121341 |
6 | 4420512500410445 |
7 | 316356465003416 |
oct | 40254654346075 |
9 | 7772841808612 |
10 | 2222221020221 |
11 | 787490918404 |
12 | 2ba8213a6a25 |
13 | 13172943c407 |
14 | 797adc0680d |
15 | 3cc1218cc9b |
hex | 20566b1cc3d |
2222221020221 has 8 divisors (see below), whose sum is σ = 2323913383104. Its totient is φ = 2120951495520.
The previous prime is 2222221020211. The next prime is 2222221020277. The reversal of 2222221020221 is 1220201222222.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2222221020221 - 218 = 2222220758077 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2222221020193 and 2222221020202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2222221020211) 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, 105698795 + ... + 105719816.
It is an arithmetic number, because the mean of its divisors is an integer number (290489172888).
Almost surely, 22222221020221 is an apocalyptic number.
It is an amenable number.
2222221020221 is a deficient number, since it is larger than the sum of its proper divisors (101692362883).
2222221020221 is a wasteful number, since it uses less digits than its factorization.
2222221020221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 211419091.
The product of its (nonzero) digits is 512, while the sum is 20.
Adding to 2222221020221 its reverse (1220201222222), we get a palindrome (3442422242443).
The spelling of 2222221020221 in words is "two trillion, two hundred twenty-two billion, two hundred twenty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •