Base | Representation |
---|---|
bin | 10001101000110001011… |
… | …111100000110110001001 |
3 | 11021212102010202022220221 |
4 | 101220301133200312021 |
5 | 124324144321401212 |
6 | 2324442404350041 |
7 | 153364523361421 |
oct | 21506137406611 |
9 | 4255363668827 |
10 | 1212011122057 |
11 | 42801375494a |
12 | 176a900a5321 |
13 | 8a3a4b44a18 |
14 | 429397dd481 |
15 | 217d9406807 |
hex | 11a317e0d89 |
1212011122057 has 2 divisors, whose sum is σ = 1212011122058. Its totient is φ = 1212011122056.
The previous prime is 1212011122001. The next prime is 1212011122067. The reversal of 1212011122057 is 7502211102121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 731878539001 + 480132583056 = 855499^2 + 692916^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1212011122057 is a prime.
It is a super-2 number, since 2×12120111220572 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1212011122067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606005561028 + 606005561029.
It is an arithmetic number, because the mean of its divisors is an integer number (606005561029).
Almost surely, 21212011122057 is an apocalyptic number.
It is an amenable number.
1212011122057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212011122057 is an equidigital number, since it uses as much as digits as its factorization.
1212011122057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 560, while the sum is 25.
Adding to 1212011122057 its reverse (7502211102121), we get a palindrome (8714222224178).
The spelling of 1212011122057 in words is "one trillion, two hundred twelve billion, eleven million, one hundred twenty-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •