Base | Representation |
---|---|
bin | 100000010111101000000011… |
… | …000000010110000110100101 |
3 | 200200001120201101210120201001 |
4 | 200113220003000112012211 |
5 | 122124420400310243042 |
6 | 1222435431323233301 |
7 | 41662150123503442 |
oct | 4027500300260645 |
9 | 620046641716631 |
10 | 142361036415397 |
11 | 413a6a81791638 |
12 | 13b72633078831 |
13 | 615878517aaa7 |
14 | 272244d27c9c9 |
15 | 116d20d3a1bb7 |
hex | 817a030161a5 |
142361036415397 has 2 divisors, whose sum is σ = 142361036415398. Its totient is φ = 142361036415396.
The previous prime is 142361036415391. The next prime is 142361036415461. The reversal of 142361036415397 is 793514630163241.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131669222027841 + 10691814387556 = 11474721^2 + 3269834^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142361036415397 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142361036415391) 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, 71180518207698 + 71180518207699.
It is an arithmetic number, because the mean of its divisors is an integer number (71180518207699).
Almost surely, 2142361036415397 is an apocalyptic number.
It is an amenable number.
142361036415397 is a deficient number, since it is larger than the sum of its proper divisors (1).
142361036415397 is an equidigital number, since it uses as much as digits as its factorization.
142361036415397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9797760, while the sum is 55.
The spelling of 142361036415397 in words is "one hundred forty-two trillion, three hundred sixty-one billion, thirty-six million, four hundred fifteen thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •