Base | Representation |
---|---|
bin | 1010111010100011101000… |
… | …0001001101010011111101 |
3 | 1120111021222010112120202120 |
4 | 2232220322001031103331 |
5 | 3033111234134121341 |
6 | 41305122412313153 |
7 | 2346023513020662 |
oct | 256507201152375 |
9 | 46437863476676 |
10 | 12001112020221 |
11 | 390770895a085 |
12 | 1419a901727b9 |
13 | 690913bbb80c |
14 | 2d6bdd569a69 |
15 | 15c29a87d066 |
hex | aea3a04d4fd |
12001112020221 has 32 divisors (see below), whose sum is σ = 16279005926400. Its totient is φ = 7863004917504.
The previous prime is 12001112020201. The next prime is 12001112020223. The reversal of 12001112020221 is 12202021110021.
It is not a de Polignac number, because 12001112020221 - 29 = 12001112019709 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12001112020221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12001112020223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 269683845 + ... + 269728341.
It is an arithmetic number, because the mean of its divisors is an integer number (508718935200).
Almost surely, 212001112020221 is an apocalyptic number.
It is an amenable number.
12001112020221 is a deficient number, since it is larger than the sum of its proper divisors (4277893906179).
12001112020221 is a wasteful number, since it uses less digits than its factorization.
12001112020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50225.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12001112020221 its reverse (12202021110021), we get a palindrome (24203133130242).
The spelling of 12001112020221 in words is "twelve trillion, one billion, one hundred twelve million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •