Base | Representation |
---|---|
bin | 10001101000111100110… |
… | …100101011110000000011 |
3 | 11021212220101110100211002 |
4 | 101220330310223300003 |
5 | 124330042003033443 |
6 | 2324513315042215 |
7 | 153402322241204 |
oct | 21507464536003 |
9 | 4255811410732 |
10 | 1212201221123 |
11 | 428100a95112 |
12 | 176b238a036b |
13 | 8a405343589 |
14 | 42956b655ab |
15 | 217eae572b8 |
hex | 11a3cd2bc03 |
1212201221123 has 2 divisors, whose sum is σ = 1212201221124. Its totient is φ = 1212201221122.
The previous prime is 1212201221093. The next prime is 1212201221129. The reversal of 1212201221123 is 3211221022121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1212201221123 - 228 = 1211932785667 is a prime.
It is a super-2 number, since 2×12122012211232 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212201221095 and 1212201221104.
It is not a weakly prime, because it can be changed into another prime (1212201221129) 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, 606100610561 + 606100610562.
It is an arithmetic number, because the mean of its divisors is an integer number (606100610562).
Almost surely, 21212201221123 is an apocalyptic number.
1212201221123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212201221123 is an equidigital number, since it uses as much as digits as its factorization.
1212201221123 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1212201221123 its reverse (3211221022121), we get a palindrome (4423422243244).
The spelling of 1212201221123 in words is "one trillion, two hundred twelve billion, two hundred one million, two hundred twenty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •