Base | Representation |
---|---|
bin | 1010111010100000010011… |
… | …0110110110010110001101 |
3 | 1120111012122222020222001201 |
4 | 2232220010312312112031 |
5 | 3033102422322043034 |
6 | 41304454111505501 |
7 | 2345662432644154 |
oct | 256500466662615 |
9 | 46435588228051 |
10 | 12000220112269 |
11 | 39072a0454474 |
12 | 1419881528291 |
13 | 69080119942c |
14 | 2d6b56d1859b |
15 | 15c2473ee014 |
hex | aea04db658d |
12000220112269 has 2 divisors, whose sum is σ = 12000220112270. Its totient is φ = 12000220112268.
The previous prime is 12000220112207. The next prime is 12000220112273. The reversal of 12000220112269 is 96221102200021.
12000220112269 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11955426506244 + 44793606025 = 3457662^2 + 211645^2 .
It is a cyclic number.
It is not a de Polignac number, because 12000220112269 - 219 = 12000219587981 is a prime.
It is a super-2 number, since 2×120002201122692 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12000220412269) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6000110056134 + 6000110056135.
It is an arithmetic number, because the mean of its divisors is an integer number (6000110056135).
Almost surely, 212000220112269 is an apocalyptic number.
It is an amenable number.
12000220112269 is a deficient number, since it is larger than the sum of its proper divisors (1).
12000220112269 is an equidigital number, since it uses as much as digits as its factorization.
12000220112269 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 12000220112269 in words is "twelve trillion, two hundred twenty million, one hundred twelve thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •