Base | Representation |
---|---|
bin | 10001101000111101011… |
… | …010010111110101110001 |
3 | 11021212221002001022111222 |
4 | 101220331122113311301 |
5 | 124330102020213131 |
6 | 2324514310514425 |
7 | 153402502230503 |
oct | 21507532276561 |
9 | 4255832038458 |
10 | 1212211101041 |
11 | 428106623036 |
12 | 176b27065a15 |
13 | 8a4073c2595 |
14 | 429581b7d73 |
15 | 217ebc5987b |
hex | 11a3d697d71 |
1212211101041 has 2 divisors, whose sum is σ = 1212211101042. Its totient is φ = 1212211101040.
The previous prime is 1212211100987. The next prime is 1212211101053. The reversal of 1212211101041 is 1401011122121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 746705102641 + 465505998400 = 864121^2 + 682280^2 .
It is a cyclic number.
It is not a de Polignac number, because 1212211101041 - 210 = 1212211100017 is a prime.
It is a super-2 number, since 2×12122111010412 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1212211100041) 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, 606105550520 + 606105550521.
It is an arithmetic number, because the mean of its divisors is an integer number (606105550521).
Almost surely, 21212211101041 is an apocalyptic number.
It is an amenable number.
1212211101041 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212211101041 is an equidigital number, since it uses as much as digits as its factorization.
1212211101041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1212211101041 its reverse (1401011122121), we get a palindrome (2613222223162).
The spelling of 1212211101041 in words is "one trillion, two hundred twelve billion, two hundred eleven million, one hundred one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •