Base | Representation |
---|---|
bin | 100000010111000111100011… |
… | …001010000001110100101101 |
3 | 200122221020122120110010011121 |
4 | 200113013203022001310231 |
5 | 122123332414420010433 |
6 | 1222411421022220541 |
7 | 41656503326005342 |
oct | 4027074312016455 |
9 | 618836576403147 |
10 | 142326142344493 |
11 | 413931a5a11708 |
12 | 13b67915124751 |
13 | 61553b3b95563 |
14 | 272089cc687c9 |
15 | 116c369c97c2d |
hex | 8171e3281d2d |
142326142344493 has 2 divisors, whose sum is σ = 142326142344494. Its totient is φ = 142326142344492.
The previous prime is 142326142344431. The next prime is 142326142344509. The reversal of 142326142344493 is 394443241623241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 121825368727209 + 20500773617284 = 11037453^2 + 4527778^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142326142344493 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142326142344493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142326142344413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71163071172246 + 71163071172247.
It is an arithmetic number, because the mean of its divisors is an integer number (71163071172247).
Almost surely, 2142326142344493 is an apocalyptic number.
It is an amenable number.
142326142344493 is a deficient number, since it is larger than the sum of its proper divisors (1).
142326142344493 is an equidigital number, since it uses as much as digits as its factorization.
142326142344493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11943936, while the sum is 52.
The spelling of 142326142344493 in words is "one hundred forty-two trillion, three hundred twenty-six billion, one hundred forty-two million, three hundred forty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •