Base | Representation |
---|---|
bin | 10001101001000101001… |
… | …110000110010011101111 |
3 | 11021220021012112210222212 |
4 | 101221011032012103233 |
5 | 124330334034214411 |
6 | 2324535310401035 |
7 | 153405652555322 |
oct | 21510516062357 |
9 | 4256235483885 |
10 | 1212342101231 |
11 | 428173568458 |
12 | 176b62b0017b |
13 | 8a42859b3a1 |
14 | 4296b7587b9 |
15 | 218084d468b |
hex | 11a453864ef |
1212342101231 has 2 divisors, whose sum is σ = 1212342101232. Its totient is φ = 1212342101230.
The previous prime is 1212342101183. The next prime is 1212342101251. The reversal of 1212342101231 is 1321012432121.
It is a strong prime.
It is an emirp because it is prime and its reverse (1321012432121) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1212342101231 - 26 = 1212342101167 is a prime.
It is a super-2 number, since 2×12123421012312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1212342101197 and 1212342101206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1212342101251) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 606171050615 + 606171050616.
It is an arithmetic number, because the mean of its divisors is an integer number (606171050616).
Almost surely, 21212342101231 is an apocalyptic number.
1212342101231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1212342101231 is an equidigital number, since it uses as much as digits as its factorization.
1212342101231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 1212342101231 its reverse (1321012432121), we get a palindrome (2533354533352).
The spelling of 1212342101231 in words is "one trillion, two hundred twelve billion, three hundred forty-two million, one hundred one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •