Base | Representation |
---|---|
bin | 10001110001001111010… |
… | …110011101111110110101 |
3 | 11022201212200211212220211 |
4 | 101301033112131332311 |
5 | 130001304103031401 |
6 | 2332544433425421 |
7 | 154136021522032 |
oct | 21611726357665 |
9 | 4281780755824 |
10 | 1221102002101 |
11 | 430959278653 |
12 | 1787a870b271 |
13 | 8b1c3394697 |
14 | 4315cd10389 |
15 | 21b6c585951 |
hex | 11c4f59dfb5 |
1221102002101 has 8 divisors (see below), whose sum is σ = 1274486583384. Its totient is φ = 1168841306880.
The previous prime is 1221102002093. The next prime is 1221102002117. The reversal of 1221102002101 is 1012002011221.
It can be written as a sum of positive squares in 4 ways, for example, as 24025310001 + 1197076692100 = 155001^2 + 1094110^2 .
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 1221102002101 - 23 = 1221102002093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221102002171) 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, 280969296 + ... + 280973641.
It is an arithmetic number, because the mean of its divisors is an integer number (159310822923).
Almost surely, 21221102002101 is an apocalyptic number.
It is an amenable number.
1221102002101 is a deficient number, since it is larger than the sum of its proper divisors (53384581283).
1221102002101 is an equidigital number, since it uses as much as digits as its factorization.
1221102002101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 561943031.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 1221102002101 its reverse (1012002011221), we get a palindrome (2233104013322).
The spelling of 1221102002101 in words is "one trillion, two hundred twenty-one billion, one hundred two million, two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •