Base | Representation |
---|---|
bin | 1010000000100101001101… |
… | …10000010111010110100001 |
3 | 2212221011012101110020201221 |
4 | 11000102212300113112201 |
5 | 10341103402242333441 |
6 | 114451203445255041 |
7 | 4431120345101635 |
oct | 500224660272641 |
9 | 85834171406657 |
10 | 22010210121121 |
11 | 7016528898a52 |
12 | 2575886a04481 |
13 | c38727c245a1 |
14 | 56142ab28dc5 |
15 | 2828093c98d1 |
hex | 1404a6c175a1 |
22010210121121 has 8 divisors (see below), whose sum is σ = 22045027586400. Its totient is φ = 21975394152960.
The previous prime is 22010210121091. The next prime is 22010210121149. The reversal of 22010210121121 is 12112101201022.
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 22010210121121 - 225 = 22010176566689 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 22010210121095 and 22010210121104.
It is not an unprimeable number, because it can be changed into a prime (22010210121161) 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, 31148710 + ... + 31847488.
It is an arithmetic number, because the mean of its divisors is an integer number (2755628448300).
Almost surely, 222010210121121 is an apocalyptic number.
It is an amenable number.
22010210121121 is a deficient number, since it is larger than the sum of its proper divisors (34817465279).
22010210121121 is an equidigital number, since it uses as much as digits as its factorization.
22010210121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 748559.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 22010210121121 its reverse (12112101201022), we get a palindrome (34122311322143).
The spelling of 22010210121121 in words is "twenty-two trillion, ten billion, two hundred ten million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •