Base | Representation |
---|---|
bin | 10110100010011101… |
… | …00111101010100101 |
3 | 1011020021200010001221 |
4 | 23101032213222211 |
5 | 144240123031341 |
6 | 5320405220341 |
7 | 605566022146 |
oct | 132116475245 |
9 | 34207603057 |
10 | 12100205221 |
11 | 514a283305 |
12 | 24184016b1 |
13 | 11aab4a860 |
14 | 82b063acd |
15 | 4ac465ed1 |
hex | 2d13a7aa5 |
12100205221 has 4 divisors (see below), whose sum is σ = 13030990252. Its totient is φ = 11169420192.
The previous prime is 12100205147. The next prime is 12100205267. The reversal of 12100205221 is 12250200121.
It is a happy number.
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 982822500 + 11117382721 = 31350^2 + 105439^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100205221 - 29 = 12100204709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12100205195 and 12100205204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12100205291) 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, 465392496 + ... + 465392521.
It is an arithmetic number, because the mean of its divisors is an integer number (3257747563).
Almost surely, 212100205221 is an apocalyptic number.
It is an amenable number.
12100205221 is a deficient number, since it is larger than the sum of its proper divisors (930785031).
12100205221 is an equidigital number, since it uses as much as digits as its factorization.
12100205221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 930785030.
The product of its (nonzero) digits is 80, while the sum is 16.
Adding to 12100205221 its reverse (12250200121), we get a palindrome (24350405342).
The spelling of 12100205221 in words is "twelve billion, one hundred million, two hundred five thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •