Base | Representation |
---|---|
bin | 11110101011010011100… |
… | …11111100111101010111 |
3 | 10201202200000101100121002 |
4 | 33111221303330331113 |
5 | 114232134301323411 |
6 | 2124115330413515 |
7 | 136103101664636 |
oct | 17255163747527 |
9 | 3652600340532 |
10 | 1054042214231 |
11 | 377020395366 |
12 | 15034473129b |
13 | 7851b61a5b6 |
14 | 3903195951d |
15 | 1c640e1e33b |
hex | f569cfcf57 |
1054042214231 has 2 divisors, whose sum is σ = 1054042214232. Its totient is φ = 1054042214230.
The previous prime is 1054042214201. The next prime is 1054042214233. The reversal of 1054042214231 is 1324122404501.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1054042214231 - 234 = 1036862345047 is a prime.
It is a super-2 number, since 2×10540422142312 (a number of 25 digits) contains 22 as substring.
Together with 1054042214233, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1054042214194 and 1054042214203.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1054042214233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 527021107115 + 527021107116.
It is an arithmetic number, because the mean of its divisors is an integer number (527021107116).
Almost surely, 21054042214231 is an apocalyptic number.
1054042214231 is a deficient number, since it is larger than the sum of its proper divisors (1).
1054042214231 is an equidigital number, since it uses as much as digits as its factorization.
1054042214231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7680, while the sum is 29.
Adding to 1054042214231 its reverse (1324122404501), we get a palindrome (2378164618732).
The spelling of 1054042214231 in words is "one trillion, fifty-four billion, forty-two million, two hundred fourteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •