Base | Representation |
---|---|
bin | 10000010100111101101… |
… | …110101011010000001101 |
3 | 10222021010122112212201122 |
4 | 100110331232223100031 |
5 | 121340400130011341 |
6 | 2215241055450325 |
7 | 144030516401345 |
oct | 20247556532015 |
9 | 3867118485648 |
10 | 1122022110221 |
11 | 3a2935259391 |
12 | 161556b269a5 |
13 | 81a6339c01c |
14 | 3c440161d25 |
15 | 1e2bdeea94b |
hex | 1053dbab40d |
1122022110221 has 8 divisors (see below), whose sum is σ = 1148172536544. Its totient is φ = 1095874269840.
The previous prime is 1122022110199. The next prime is 1122022110227. The reversal of 1122022110221 is 1220112202211.
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 1122022110221 - 222 = 1122017915917 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 1122022110221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1122022110227) 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, 245591 + ... + 1518011.
It is an arithmetic number, because the mean of its divisors is an integer number (143521567068).
Almost surely, 21122022110221 is an apocalyptic number.
It is an amenable number.
1122022110221 is a deficient number, since it is larger than the sum of its proper divisors (26150426323).
1122022110221 is a wasteful number, since it uses less digits than its factorization.
1122022110221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1292971.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1122022110221 its reverse (1220112202211), we get a palindrome (2342134312432).
The spelling of 1122022110221 in words is "one trillion, one hundred twenty-two billion, twenty-two million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •