Base | Representation |
---|---|
bin | 1011000111010011011111… |
… | …1110100010111101000101 |
3 | 1121021020021020202120122112 |
4 | 2301310313332202331011 |
5 | 3100203302000200401 |
6 | 41553502433110405 |
7 | 2400605664335645 |
oct | 261646776427505 |
9 | 47236236676575 |
10 | 12220121100101 |
11 | 3991584868352 |
12 | 14544119b8405 |
13 | 6a8477507245 |
14 | 3036580aa525 |
15 | 162d17a823bb |
hex | b1d37fa2f45 |
12220121100101 has 8 divisors (see below), whose sum is σ = 12264559367424. Its totient is φ = 12175715815920.
The previous prime is 12220121100043. The next prime is 12220121100157. The reversal of 12220121100101 is 10100112102221.
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 12220121100101 - 210 = 12220121099077 is a prime.
It is a super-2 number, since 2×122201211001012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12220121100181) 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, 7503326 + ... + 8985551.
It is an arithmetic number, because the mean of its divisors is an integer number (1533069920928).
Almost surely, 212220121100101 is an apocalyptic number.
It is an amenable number.
12220121100101 is a deficient number, since it is larger than the sum of its proper divisors (44438267323).
12220121100101 is a wasteful number, since it uses less digits than its factorization.
12220121100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16491571.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12220121100101 its reverse (10100112102221), we get a palindrome (22320233202322).
The spelling of 12220121100101 in words is "twelve trillion, two hundred twenty billion, one hundred twenty-one million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •