Base | Representation |
---|---|
bin | 100000011001001010001011… |
… | …010011000000010110001111 |
3 | 200200102122200112011012220022 |
4 | 200121022023103000112033 |
5 | 122133132142432123003 |
6 | 1223000054530212355 |
7 | 42002600154213401 |
oct | 4031121323002617 |
9 | 620378615135808 |
10 | 142466402223503 |
11 | 41437730a66796 |
12 | 13b8ab39a240bb |
13 | 61656a75486c7 |
14 | 27275a6bc4b71 |
15 | 1170d28700738 |
hex | 81928b4c058f |
142466402223503 has 2 divisors, whose sum is σ = 142466402223504. Its totient is φ = 142466402223502.
The previous prime is 142466402223493. The next prime is 142466402223521. The reversal of 142466402223503 is 305322204664241.
It is a weak prime.
It is an emirp because it is prime and its reverse (305322204664241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142466402223503 - 210 = 142466402222479 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142466402213503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71233201111751 + 71233201111752.
It is an arithmetic number, because the mean of its divisors is an integer number (71233201111752).
Almost surely, 2142466402223503 is an apocalyptic number.
142466402223503 is a deficient number, since it is larger than the sum of its proper divisors (1).
142466402223503 is an equidigital number, since it uses as much as digits as its factorization.
142466402223503 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1658880, while the sum is 44.
Adding to 142466402223503 its reverse (305322204664241), we get a palindrome (447788606887744).
The spelling of 142466402223503 in words is "one hundred forty-two trillion, four hundred sixty-six billion, four hundred two million, two hundred twenty-three thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •