Base | Representation |
---|---|
bin | 1010111010100000010001… |
… | …0000010100010001010101 |
3 | 1120111012122021020210000211 |
4 | 2232220010100110101111 |
5 | 3033102412230324341 |
6 | 41304453111205421 |
7 | 2345662251044065 |
oct | 256500420242125 |
9 | 46435567223024 |
10 | 12000210011221 |
11 | 39072957853a3 |
12 | 141987a076871 |
13 | 6907cc070893 |
14 | 2d6b558493a5 |
15 | 15c2465a6181 |
hex | aea04414455 |
12000210011221 has 4 divisors (see below), whose sum is σ = 12000300154444. Its totient is φ = 12000119868000.
The previous prime is 12000210011183. The next prime is 12000210011243. The reversal of 12000210011221 is 12211001200021.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5818467622500 + 6181742388721 = 2412150^2 + 2486311^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000210011221 - 29 = 12000210010709 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000210011261) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 44871630 + ... + 45138271.
It is an arithmetic number, because the mean of its divisors is an integer number (3000075038611).
Almost surely, 212000210011221 is an apocalyptic number.
It is an amenable number.
12000210011221 is a deficient number, since it is larger than the sum of its proper divisors (90143223).
12000210011221 is an equidigital number, since it uses as much as digits as its factorization.
12000210011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90143222.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 12000210011221 its reverse (12211001200021), we get a palindrome (24211211211242).
The spelling of 12000210011221 in words is "twelve trillion, two hundred ten million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •