Base | Representation |
---|---|
bin | 11011100100001001011101… |
… | …010011111110011010011111 |
3 | 120220020121012121022121100112 |
4 | 123210021131103332122133 |
5 | 111342223211434224432 |
6 | 1105500521315120235 |
7 | 34351446636053051 |
oct | 3344113523763237 |
9 | 526217177277315 |
10 | 121231312414367 |
11 | 3569aa02400701 |
12 | 1171b5352a307b |
13 | 52850a9c701cc |
14 | 21d18ac0358d1 |
15 | e037882ad7b2 |
hex | 6e425d4fe69f |
121231312414367 has 2 divisors, whose sum is σ = 121231312414368. Its totient is φ = 121231312414366.
The previous prime is 121231312414363. The next prime is 121231312414369. The reversal of 121231312414367 is 763414213132121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 121231312414367 - 22 = 121231312414363 is a prime.
It is a super-2 number, since 2×1212313124143672 (a number of 29 digits) contains 22 as substring.
Together with 121231312414369, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (121231312414363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60615656207183 + 60615656207184.
It is an arithmetic number, because the mean of its divisors is an integer number (60615656207184).
Almost surely, 2121231312414367 is an apocalyptic number.
121231312414367 is a deficient number, since it is larger than the sum of its proper divisors (1).
121231312414367 is an equidigital number, since it uses as much as digits as its factorization.
121231312414367 is an evil number, because the sum of its binary digits is even.
The product of its digits is 145152, while the sum is 41.
Adding to 121231312414367 its reverse (763414213132121), we get a palindrome (884645525546488).
The spelling of 121231312414367 in words is "one hundred twenty-one trillion, two hundred thirty-one billion, three hundred twelve million, four hundred fourteen thousand, three hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •