Base | Representation |
---|---|
bin | 100000010111101001100000… |
… | …000010101101011011010101 |
3 | 200200001201202011220120012221 |
4 | 200113221200002231123111 |
5 | 122124432044403110214 |
6 | 1222440250242542341 |
7 | 41662233606110116 |
oct | 4027514002553325 |
9 | 620051664816187 |
10 | 142362597316309 |
11 | 413a7702888597 |
12 | 13b729a99679b1 |
13 | 61589736740b6 |
14 | 272255a6b620d |
15 | 116d2a042ae24 |
hex | 817a600ad6d5 |
142362597316309 has 2 divisors, whose sum is σ = 142362597316310. Its totient is φ = 142362597316308.
The previous prime is 142362597316231. The next prime is 142362597316397. The reversal of 142362597316309 is 903613795263241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 130470079522500 + 11892517793809 = 11422350^2 + 3448553^2 .
It is a cyclic number.
It is not a de Polignac number, because 142362597316309 - 219 = 142362596792021 is a prime.
It is a super-2 number, since 2×1423625973163092 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142362597310309) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71181298658154 + 71181298658155.
It is an arithmetic number, because the mean of its divisors is an integer number (71181298658155).
Almost surely, 2142362597316309 is an apocalyptic number.
It is an amenable number.
142362597316309 is a deficient number, since it is larger than the sum of its proper divisors (1).
142362597316309 is an equidigital number, since it uses as much as digits as its factorization.
142362597316309 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 44089920, while the sum is 61.
The spelling of 142362597316309 in words is "one hundred forty-two trillion, three hundred sixty-two billion, five hundred ninety-seven million, three hundred sixteen thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •