Base | Representation |
---|---|
bin | 10010111011110111100… |
… | …110101101001001001111 |
3 | 11121101201020210110010112 |
4 | 102323313212231021033 |
5 | 132304411431222002 |
6 | 2433440113430235 |
7 | 163003540364051 |
oct | 22736746551117 |
9 | 4541636713115 |
10 | 1301234242127 |
11 | 461939896606 |
12 | 19023086b37b |
13 | 95923a1a721 |
14 | 46da146d8d1 |
15 | 23cac476852 |
hex | 12ef79ad24f |
1301234242127 has 2 divisors, whose sum is σ = 1301234242128. Its totient is φ = 1301234242126.
The previous prime is 1301234242109. The next prime is 1301234242141. The reversal of 1301234242127 is 7212424321031.
It is a strong prime.
It is an emirp because it is prime and its reverse (7212424321031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1301234242127 - 28 = 1301234241871 is a prime.
It is a super-2 number, since 2×13012342421272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1301234242093 and 1301234242102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1301234212127) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 650617121063 + 650617121064.
It is an arithmetic number, because the mean of its divisors is an integer number (650617121064).
Almost surely, 21301234242127 is an apocalyptic number.
1301234242127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1301234242127 is an equidigital number, since it uses as much as digits as its factorization.
1301234242127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 32.
Adding to 1301234242127 its reverse (7212424321031), we get a palindrome (8513658563158).
The spelling of 1301234242127 in words is "one trillion, three hundred one billion, two hundred thirty-four million, two hundred forty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •