Base | Representation |
---|---|
bin | 1100110100000001001… |
… | …1010000001110100001 |
3 | 210001011200121100102122 |
4 | 3031000103100032201 |
5 | 12101302230333441 |
6 | 245042300554025 |
7 | 21621555105110 |
oct | 3150023201641 |
9 | 701150540378 |
10 | 220122121121 |
11 | 85398220671 |
12 | 367b2552915 |
13 | 179b00b4316 |
14 | a9226b5c77 |
15 | 5ad4cb434b |
hex | 33404d03a1 |
220122121121 has 8 divisors (see below), whose sum is σ = 251702180160. Its totient is φ = 188575572528.
The previous prime is 220122121111. The next prime is 220122121123. The reversal of 220122121121 is 121121221022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-220122121121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 220122121121.
It is not an unprimeable number, because it can be changed into a prime (220122121123) 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, 8363531 + ... + 8389808.
It is an arithmetic number, because the mean of its divisors is an integer number (31462772520).
Almost surely, 2220122121121 is an apocalyptic number.
It is an amenable number.
220122121121 is a deficient number, since it is larger than the sum of its proper divisors (31580059039).
220122121121 is a wasteful number, since it uses less digits than its factorization.
220122121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16755223.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 220122121121 its reverse (121121221022), we get a palindrome (341243342143).
Subtracting from 220122121121 its reverse (121121221022), we obtain a palindrome (99000900099).
The spelling of 220122121121 in words is "two hundred twenty billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •