Base | Representation |
---|---|
bin | 1011000110110010010011… |
… | …1101000110100110000101 |
3 | 1121020101021100202102102121 |
4 | 2301230210331012212011 |
5 | 3100032030234120401 |
6 | 41545430420405541 |
7 | 2400142134401533 |
oct | 261544475064605 |
9 | 47211240672377 |
10 | 12211212020101 |
11 | 3988822926716 |
12 | 14527462468b1 |
13 | 6a768783b883 |
14 | 303050ba1153 |
15 | 162995864ca1 |
hex | b1b24f46985 |
12211212020101 has 8 divisors (see below), whose sum is σ = 12853953655200. Its totient is φ = 11568475011600.
The previous prime is 12211212020087. The next prime is 12211212020179. The reversal of 12211212020101 is 10102021211221.
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 12211212020101 - 25 = 12211212020069 is a prime.
It is a super-2 number, since 2×122112120201012 (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 (12211212020401) 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, 5139930 + ... + 7130308.
It is an arithmetic number, because the mean of its divisors is an integer number (1606744206900).
Almost surely, 212211212020101 is an apocalyptic number.
It is an amenable number.
12211212020101 is a deficient number, since it is larger than the sum of its proper divisors (642741635099).
12211212020101 is a wasteful number, since it uses less digits than its factorization.
12211212020101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2313299.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 12211212020101 its reverse (10102021211221), we get a palindrome (22313233231322).
The spelling of 12211212020101 in words is "twelve trillion, two hundred eleven billion, two hundred twelve million, twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •