Base | Representation |
---|---|
bin | 1011000111010011011011… |
… | …0010101010111111110101 |
3 | 1121021020012212100001200212 |
4 | 2301310312302222333311 |
5 | 3100203231402210401 |
6 | 41553500442515205 |
7 | 2400605333305421 |
oct | 261646662527765 |
9 | 47236185301625 |
10 | 12220101210101 |
11 | 3991574612734 |
12 | 1454407205b05 |
13 | 6a8473361c05 |
14 | 3036555adb81 |
15 | 162d15e53dbb |
hex | b1d36caaff5 |
12220101210101 has 8 divisors (see below), whose sum is σ = 12264499915104. Its totient is φ = 12175711084080.
The previous prime is 12220101210091. The next prime is 12220101210127. The reversal of 12220101210101 is 10101210102221.
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 12220101210101 - 214 = 12220101193717 is a prime.
It is a super-2 number, since 2×122201012101012 (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 (12220101210181) 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, 716195 + ... + 4995311.
It is an arithmetic number, because the mean of its divisors is an integer number (1533062489388).
Almost surely, 212220101210101 is an apocalyptic number.
It is an amenable number.
12220101210101 is a deficient number, since it is larger than the sum of its proper divisors (44398705003).
12220101210101 is a wasteful number, since it uses less digits than its factorization.
12220101210101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4289491.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 12220101210101 its reverse (10101210102221), we get a palindrome (22321311312322).
The spelling of 12220101210101 in words is "twelve trillion, two hundred twenty billion, one hundred one million, two hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •