Base | Representation |
---|---|
bin | 1010000000100101001110… |
… | …11010101101100011101001 |
3 | 2212221011020011100020110002 |
4 | 11000102213122231203221 |
5 | 10341103413113101441 |
6 | 114451204523232345 |
7 | 4431120541335236 |
oct | 500224732554351 |
9 | 85834204306402 |
10 | 22010221222121 |
11 | 7016534090330 |
12 | 257588a6786b5 |
13 | c3872a310322 |
14 | 56142c3b878d |
15 | 28280a36db9b |
hex | 1404a76ad8e9 |
22010221222121 has 8 divisors (see below), whose sum is σ = 24011243688000. Its totient is φ = 20009214300240.
The previous prime is 22010221222049. The next prime is 22010221222133. The reversal of 22010221222121 is 12122212201022.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 22010221222121 - 214 = 22010221205737 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 = 22010221222093 and 22010221222102.
It is not an unprimeable number, because it can be changed into a prime (22010221222151) 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, 820106 + ... + 6685283.
It is an arithmetic number, because the mean of its divisors is an integer number (3001405461000).
Almost surely, 222010221222121 is an apocalyptic number.
It is an amenable number.
22010221222121 is a deficient number, since it is larger than the sum of its proper divisors (2001022465879).
22010221222121 is a wasteful number, since it uses less digits than its factorization.
22010221222121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7771999.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 22010221222121 its reverse (12122212201022), we get a palindrome (34132433423143).
The spelling of 22010221222121 in words is "twenty-two trillion, ten billion, two hundred twenty-one million, two hundred twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •