Base | Representation |
---|---|
bin | 1011000001100010101010… |
… | …0110000010010011001001 |
3 | 1120220202201011021120222011 |
4 | 2300120222212002103021 |
5 | 3042043014223321043 |
6 | 41440210115255521 |
7 | 2360502314534632 |
oct | 260305246022311 |
9 | 46822634246864 |
10 | 12121112323273 |
11 | 3953597a00958 |
12 | 143919bbaa5a1 |
13 | 69c029180ab5 |
14 | 2dc944950889 |
15 | 16047089359d |
hex | b062a9824c9 |
12121112323273 has 2 divisors, whose sum is σ = 12121112323274. Its totient is φ = 12121112323272.
The previous prime is 12121112323193. The next prime is 12121112323337. The reversal of 12121112323273 is 37232321112121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8680966537104 + 3440145786169 = 2946348^2 + 1854763^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12121112323273 is a prime.
It is not a weakly prime, because it can be changed into another prime (12121112323373) 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, 6060556161636 + 6060556161637.
It is an arithmetic number, because the mean of its divisors is an integer number (6060556161637).
Almost surely, 212121112323273 is an apocalyptic number.
It is an amenable number.
12121112323273 is a deficient number, since it is larger than the sum of its proper divisors (1).
12121112323273 is an equidigital number, since it uses as much as digits as its factorization.
12121112323273 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6048, while the sum is 31.
Adding to 12121112323273 its reverse (37232321112121), we get a palindrome (49353433435394).
The spelling of 12121112323273 in words is "twelve trillion, one hundred twenty-one billion, one hundred twelve million, three hundred twenty-three thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •