Base | Representation |
---|---|
bin | 1011000000011100001101… |
… | …1001001000111001110101 |
3 | 1120211221220012022211220012 |
4 | 2300013003121020321311 |
5 | 3041240301430120041 |
6 | 41423401400350005 |
7 | 2356232552236010 |
oct | 260070331107165 |
9 | 46757805284805 |
10 | 12102201020021 |
11 | 3946572a76912 |
12 | 14355a2775305 |
13 | 69a3041ca028 |
14 | 2dba6d0a4377 |
15 | 15ec154c93eb |
hex | b01c3648e75 |
12102201020021 has 8 divisors (see below), whose sum is σ = 14277250973184. Its totient is φ = 10038692090160.
The previous prime is 12102201020017. The next prime is 12102201020053. The reversal of 12102201020021 is 12002010220121.
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 12102201020021 - 22 = 12102201020017 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12102201019978 and 12102201020005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12102201010021) 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, 27885255590 + ... + 27885256023.
It is an arithmetic number, because the mean of its divisors is an integer number (1784656371648).
Almost surely, 212102201020021 is an apocalyptic number.
It is an amenable number.
12102201020021 is a deficient number, since it is larger than the sum of its proper divisors (2175049953163).
12102201020021 is an equidigital number, since it uses as much as digits as its factorization.
12102201020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55770511651.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12102201020021 its reverse (12002010220121), we get a palindrome (24104211240142).
The spelling of 12102201020021 in words is "twelve trillion, one hundred two billion, two hundred one million, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •