Base | Representation |
---|---|
bin | 10001110010000110001… |
… | …100000001100010001101 |
3 | 11022211020211000011220021 |
4 | 101302012030001202031 |
5 | 130010200113323041 |
6 | 2333220020422141 |
7 | 154200562464550 |
oct | 21620614014215 |
9 | 4284224004807 |
10 | 1222022011021 |
11 | 4312906269a9 |
12 | 178a04847951 |
13 | 8b30bb75566 |
14 | 43209198697 |
15 | 21bc3215cd1 |
hex | 11c8630188d |
1222022011021 has 8 divisors (see below), whose sum is σ = 1399836950784. Its totient is φ = 1045017162960.
The previous prime is 1222022010967. The next prime is 1222022011109. The reversal of 1222022011021 is 1201102202221.
It is a happy number.
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 1222022011021 - 27 = 1222022010893 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1222022010986 and 1222022011004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1222022041021) 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, 202519690 + ... + 202525723.
It is an arithmetic number, because the mean of its divisors is an integer number (174979618848).
Almost surely, 21222022011021 is an apocalyptic number.
It is an amenable number.
1222022011021 is a deficient number, since it is larger than the sum of its proper divisors (177814939763).
1222022011021 is an equidigital number, since it uses as much as digits as its factorization.
1222022011021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 405045851.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1222022011021 its reverse (1201102202221), we get a palindrome (2423124213242).
The spelling of 1222022011021 in words is "one trillion, two hundred twenty-two billion, twenty-two million, eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •