Base | Representation |
---|---|
bin | 1000010000111111101… |
… | …1010110011101101101 |
3 | 111120112022012012100112 |
4 | 2010033323112131231 |
5 | 4311304242400032 |
6 | 145122345105405 |
7 | 13154630516321 |
oct | 2041773263555 |
9 | 446468165315 |
10 | 142001137517 |
11 | 55249a383a8 |
12 | 2362ba88265 |
13 | 10510347035 |
14 | 6c31301981 |
15 | 3a6175b1b2 |
hex | 210fed676d |
142001137517 has 2 divisors, whose sum is σ = 142001137518. Its totient is φ = 142001137516.
The previous prime is 142001137507. The next prime is 142001137573. The reversal of 142001137517 is 715731100241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95566921321 + 46434216196 = 309139^2 + 215486^2 .
It is an emirp because it is prime and its reverse (715731100241) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-142001137517 is a prime.
It is a super-2 number, since 2×1420011375172 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142001137507) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71000568758 + 71000568759.
It is an arithmetic number, because the mean of its divisors is an integer number (71000568759).
Almost surely, 2142001137517 is an apocalyptic number.
It is an amenable number.
142001137517 is a deficient number, since it is larger than the sum of its proper divisors (1).
142001137517 is an equidigital number, since it uses as much as digits as its factorization.
142001137517 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5880, while the sum is 32.
Adding to 142001137517 its reverse (715731100241), we get a palindrome (857732237758).
The spelling of 142001137517 in words is "one hundred forty-two billion, one million, one hundred thirty-seven thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •