Base | Representation |
---|---|
bin | 10110110000110111… |
… | …00010001101100101 |
3 | 1011112201000201020202 |
4 | 23120123202031211 |
5 | 200012041000034 |
6 | 5340403040245 |
7 | 611564023526 |
oct | 133033421545 |
9 | 34481021222 |
10 | 12221031269 |
11 | 52014a9747 |
12 | 2450970085 |
13 | 11c9ba3765 |
14 | 83d11684d |
15 | 4b7d8147e |
hex | 2d86e2365 |
12221031269 has 2 divisors, whose sum is σ = 12221031270. Its totient is φ = 12221031268.
The previous prime is 12221031239. The next prime is 12221031283. The reversal of 12221031269 is 96213012221.
12221031269 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., 11802215044 + 418816225 = 108638^2 + 20465^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221031269 - 28 = 12221031013 is a prime.
It is a super-2 number, since 2×122210312692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12221031239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110515634 + 6110515635.
It is an arithmetic number, because the mean of its divisors is an integer number (6110515635).
Almost surely, 212221031269 is an apocalyptic number.
It is an amenable number.
12221031269 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221031269 is an equidigital number, since it uses as much as digits as its factorization.
12221031269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 12221031269 in words is "twelve billion, two hundred twenty-one million, thirty-one thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •