Base | Representation |
---|---|
bin | 1010111100010011110010… |
… | …1011000000011110110101 |
3 | 1120121011200111110122020012 |
4 | 2233010330223000132311 |
5 | 3034104420123200341 |
6 | 41331022230550005 |
7 | 2351140610504111 |
oct | 257047453003665 |
9 | 46534614418205 |
10 | 12031221303221 |
11 | 391945985503a |
12 | 1423893808305 |
13 | 693701ac77c3 |
14 | 2d8458300741 |
15 | 15ce5dd920eb |
hex | af13cac07b5 |
12031221303221 has 2 divisors, whose sum is σ = 12031221303222. Its totient is φ = 12031221303220.
The previous prime is 12031221303209. The next prime is 12031221303229. The reversal of 12031221303221 is 12230312213021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9932040492196 + 2099180811025 = 3151514^2 + 1448855^2 .
It is a cyclic number.
It is not a de Polignac number, because 12031221303221 - 214 = 12031221286837 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12031221303229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6015610651610 + 6015610651611.
It is an arithmetic number, because the mean of its divisors is an integer number (6015610651611).
Almost surely, 212031221303221 is an apocalyptic number.
It is an amenable number.
12031221303221 is a deficient number, since it is larger than the sum of its proper divisors (1).
12031221303221 is an equidigital number, since it uses as much as digits as its factorization.
12031221303221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12031221303221 its reverse (12230312213021), we get a palindrome (24261533516242).
The spelling of 12031221303221 in words is "twelve trillion, thirty-one billion, two hundred twenty-one million, three hundred three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •