Base | Representation |
---|---|
bin | 1011000000010100110011… |
… | …0110011110000011011001 |
3 | 1120211202202121001100022122 |
4 | 2300011030312132003121 |
5 | 3041222213312020441 |
6 | 41422432153431025 |
7 | 2356132352562404 |
oct | 260051466360331 |
9 | 46752677040278 |
10 | 12100212220121 |
11 | 394574238a033 |
12 | 143512870b475 |
13 | 69a07817485c |
14 | 2db920cc2d3b |
15 | 15eb4aaca34b |
hex | b014cd9e0d9 |
12100212220121 has 8 divisors (see below), whose sum is σ = 12112847637120. Its totient is φ = 12087583100208.
The previous prime is 12100212220111. The next prime is 12100212220153. The reversal of 12100212220121 is 12102221200121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12100212220121 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12100212220121.
It is not an unprimeable number, because it can be changed into a prime (12100212220111) 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, 2275760 + ... + 5420286.
It is an arithmetic number, because the mean of its divisors is an integer number (1514105954640).
Almost surely, 212100212220121 is an apocalyptic number.
It is an amenable number.
12100212220121 is a deficient number, since it is larger than the sum of its proper divisors (12635416999).
12100212220121 is a wasteful number, since it uses less digits than its factorization.
12100212220121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3148543.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 12100212220121 its reverse (12102221200121), we get a palindrome (24202433420242).
The spelling of 12100212220121 in words is "twelve trillion, one hundred billion, two hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •