Base | Representation |
---|---|
bin | 1011000110110101101000… |
… | …0000111000001011110111 |
3 | 1121020110120101210100120101 |
4 | 2301231122000320023313 |
5 | 3100040341130431403 |
6 | 41550055020214531 |
7 | 2400203163666406 |
oct | 261553200701367 |
9 | 47213511710511 |
10 | 12212102202103 |
11 | 398913a362621 |
12 | 145295439a447 |
13 | 6a779a0a849b |
14 | 3030d70c363d |
15 | 1629e8aa271d |
hex | b1b5a0382f7 |
12212102202103 has 8 divisors (see below), whose sum is σ = 12606284364416. Its totient is φ = 11817935251200.
The previous prime is 12212102202089. The next prime is 12212102202121. The reversal of 12212102202103 is 30120220121221.
12212102202103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 12212102202103 - 29 = 12212102201591 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12212102202803) 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, 2160018 + ... + 5393503.
It is an arithmetic number, because the mean of its divisors is an integer number (1575785545552).
Almost surely, 212212102202103 is an apocalyptic number.
12212102202103 is a deficient number, since it is larger than the sum of its proper divisors (394182162313).
12212102202103 is an equidigital number, since it uses as much as digits as its factorization.
12212102202103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7605705.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 12212102202103 its reverse (30120220121221), we get a palindrome (42332322323324).
The spelling of 12212102202103 in words is "twelve trillion, two hundred twelve billion, one hundred two million, two hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •