Base | Representation |
---|---|
bin | 1011000110110110010111… |
… | …1011100000010010000101 |
3 | 1121020111002022222020110111 |
4 | 2301231211323200102011 |
5 | 3100041243320320234 |
6 | 41550130521153021 |
7 | 2400211142162542 |
oct | 261554573402205 |
9 | 47214068866414 |
10 | 12212302120069 |
11 | 3989232199987 |
12 | 14529ab32b771 |
13 | 6a77cc63433c |
14 | 303115883bc9 |
15 | 162a0b3e2664 |
hex | b1b65ee0485 |
12212302120069 has 2 divisors, whose sum is σ = 12212302120070. Its totient is φ = 12212302120068.
The previous prime is 12212302120033. The next prime is 12212302120189. The reversal of 12212302120069 is 96002120321221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7617765600900 + 4594536519169 = 2760030^2 + 2143487^2 .
It is a cyclic number.
It is not a de Polignac number, because 12212302120069 - 211 = 12212302118021 is a prime.
It is a super-2 number, since 2×122123021200692 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12212302120069.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12212302120009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106151060034 + 6106151060035.
It is an arithmetic number, because the mean of its divisors is an integer number (6106151060035).
Almost surely, 212212302120069 is an apocalyptic number.
It is an amenable number.
12212302120069 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212302120069 is an equidigital number, since it uses as much as digits as its factorization.
12212302120069 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The spelling of 12212302120069 in words is "twelve trillion, two hundred twelve billion, three hundred two million, one hundred twenty thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •