Base | Representation |
---|---|
bin | 10001101000111101010… |
… | …110101000110110011111 |
3 | 11021212221000012120201111 |
4 | 101220331112220312133 |
5 | 124330101242402033 |
6 | 2324514233522451 |
7 | 153402461012536 |
oct | 21507526506637 |
9 | 4255830176644 |
10 | 1212210122143 |
11 | 428106014629 |
12 | 176b26873427 |
13 | 8a40713bb57 |
14 | 4295800131d |
15 | 217ebb147cd |
hex | 11a3d5a8d9f |
1212210122143 has 2 divisors, whose sum is σ = 1212210122144. Its totient is φ = 1212210122142.
The previous prime is 1212210122083. The next prime is 1212210122161. The reversal of 1212210122143 is 3412210122121.
It is a strong prime.
It is an emirp because it is prime and its reverse (3412210122121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212210122143 - 221 = 1212208024991 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212210122443) 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, 606105061071 + 606105061072.
It is an arithmetic number, because the mean of its divisors is an integer number (606105061072).
Almost surely, 21212210122143 is an apocalyptic number.
1212210122143 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212210122143 is an equidigital number, since it uses as much as digits as its factorization.
1212210122143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Subtracting from 1212210122143 its sum of digits (22), we obtain a palindrome (1212210122121).
Adding to 1212210122143 its reverse (3412210122121), we get a palindrome (4624420244264).
The spelling of 1212210122143 in words is "one trillion, two hundred twelve billion, two hundred ten million, one hundred twenty-two thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •