Base | Representation |
---|---|
bin | 10001110001001111010… |
… | …110110110001000011110 |
3 | 11022201212201000220121120 |
4 | 101301033112312020132 |
5 | 130001304114213042 |
6 | 2332544435511410 |
7 | 154136022413316 |
oct | 21611726661036 |
9 | 4281781026546 |
10 | 1221102101022 |
11 | 430959335a01 |
12 | 1787a8758566 |
13 | 8b1c33ca70b |
14 | 4315cd38446 |
15 | 21b6c5a4dec |
hex | 11c4f5b621e |
1221102101022 has 8 divisors (see below), whose sum is σ = 2442204202056. Its totient is φ = 407034033672.
The previous prime is 1221102100991. The next prime is 1221102101041. The reversal of 1221102101022 is 2201012011221.
It is a sphenic number, since it is the product of 3 distinct primes.
1221102101022 is an admirable number.
It is a super-2 number, since 2×12211021010222 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221102100992 and 1221102101010.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 101758508413 + ... + 101758508424.
It is an arithmetic number, because the mean of its divisors is an integer number (305275525257).
Almost surely, 21221102101022 is an apocalyptic number.
1221102101022 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221102101022 is a wasteful number, since it uses less digits than its factorization.
1221102101022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 203517016842.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1221102101022 its reverse (2201012011221), we get a palindrome (3422114112243).
The spelling of 1221102101022 in words is "one trillion, two hundred twenty-one billion, one hundred two million, one hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •