Base | Representation |
---|---|
bin | 1000010010010101010… |
… | …1110110100011000101 |
3 | 111121110100012221100112 |
4 | 2010211111312203011 |
5 | 4313023230444323 |
6 | 145222141322405 |
7 | 13166552326034 |
oct | 2044525664305 |
9 | 447410187315 |
10 | 142360406213 |
11 | 55413813283 |
12 | 23710266405 |
13 | 105698c6c6c |
14 | 6c66d0271b |
15 | 3a83076178 |
hex | 21255768c5 |
142360406213 has 2 divisors, whose sum is σ = 142360406214. Its totient is φ = 142360406212.
The previous prime is 142360406191. The next prime is 142360406281. The reversal of 142360406213 is 312604063241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132483624289 + 9876781924 = 363983^2 + 99382^2 .
It is a cyclic number.
It is not a de Polignac number, because 142360406213 - 216 = 142360340677 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142360406213.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142360408213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71180203106 + 71180203107.
It is an arithmetic number, because the mean of its divisors is an integer number (71180203107).
Almost surely, 2142360406213 is an apocalyptic number.
It is an amenable number.
142360406213 is a deficient number, since it is larger than the sum of its proper divisors (1).
142360406213 is an equidigital number, since it uses as much as digits as its factorization.
142360406213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
Adding to 142360406213 its reverse (312604063241), we get a palindrome (454964469454).
The spelling of 142360406213 in words is "one hundred forty-two billion, three hundred sixty million, four hundred six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •