Base | Representation |
---|---|
bin | 11100000001011001011111… |
… | …111100010101011000001111 |
3 | 121011100202121011002001121221 |
4 | 130001121133330111120033 |
5 | 112123141342204240101 |
6 | 1114040152414504211 |
7 | 34646616545150122 |
oct | 3401313774253017 |
9 | 534322534061557 |
10 | 123241401243151 |
11 | 362a5426117914 |
12 | 119a5013b05067 |
13 | 539c7ca723849 |
14 | 2260cb676c3b9 |
15 | e3abd1d43aa1 |
hex | 70165ff1560f |
123241401243151 has 2 divisors, whose sum is σ = 123241401243152. Its totient is φ = 123241401243150.
The previous prime is 123241401243137. The next prime is 123241401243157. The reversal of 123241401243151 is 151342104142321.
It is a strong prime.
It is an emirp because it is prime and its reverse (151342104142321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 123241401243151 - 25 = 123241401243119 is a prime.
It is a super-3 number, since 3×1232414012431513 (a number of 43 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123241401243157) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61620700621575 + 61620700621576.
It is an arithmetic number, because the mean of its divisors is an integer number (61620700621576).
Almost surely, 2123241401243151 is an apocalyptic number.
123241401243151 is a deficient number, since it is larger than the sum of its proper divisors (1).
123241401243151 is an equidigital number, since it uses as much as digits as its factorization.
123241401243151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 123241401243151 its reverse (151342104142321), we get a palindrome (274583505385472).
The spelling of 123241401243151 in words is "one hundred twenty-three trillion, two hundred forty-one billion, four hundred one million, two hundred forty-three thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •