Base | Representation |
---|---|
bin | 10001110010001010111… |
… | …110011000100001011001 |
3 | 11022211110102010100210212 |
4 | 101302022332120201121 |
5 | 130010331143234431 |
6 | 2333232010020505 |
7 | 154202556222254 |
oct | 21621276304131 |
9 | 4284412110725 |
10 | 1222102321241 |
11 | 43132199a18a |
12 | 178a27717735 |
13 | 8b3226b3bb9 |
14 | 43215b0209b |
15 | 21bca2cb72b |
hex | 11c8af98859 |
1222102321241 has 2 divisors, whose sum is σ = 1222102321242. Its totient is φ = 1222102321240.
The previous prime is 1222102321207. The next prime is 1222102321277. The reversal of 1222102321241 is 1421232012221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1203979507600 + 18122813641 = 1097260^2 + 134621^2 .
It is a cyclic number.
It is not a de Polignac number, because 1222102321241 - 222 = 1222098126937 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1222102321441) 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, 611051160620 + 611051160621.
It is an arithmetic number, because the mean of its divisors is an integer number (611051160621).
Almost surely, 21222102321241 is an apocalyptic number.
It is an amenable number.
1222102321241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1222102321241 is an equidigital number, since it uses as much as digits as its factorization.
1222102321241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 1222102321241 its reverse (1421232012221), we get a palindrome (2643334333462).
The spelling of 1222102321241 in words is "one trillion, two hundred twenty-two billion, one hundred two million, three hundred twenty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •