Base | Representation |
---|---|
bin | 1000010010001010100… |
… | …0110010110100001001 |
3 | 111121100011212002121202 |
4 | 2010202220302310021 |
5 | 4312430122240014 |
6 | 145213441113545 |
7 | 13165461611042 |
oct | 2044250626411 |
9 | 447304762552 |
10 | 142315040009 |
11 | 553a0147a4a |
12 | 236b90288b5 |
13 | 105603a1a5c |
14 | 6c60c938c9 |
15 | 3a7e0b43de |
hex | 2122a32d09 |
142315040009 has 2 divisors, whose sum is σ = 142315040010. Its totient is φ = 142315040008.
The previous prime is 142315039991. The next prime is 142315040027. The reversal of 142315040009 is 900040513241.
It is a balanced prime because it is at equal distance from previous prime (142315039991) and next prime (142315040027).
It can be written as a sum of positive squares in only one way, i.e., 135591859984 + 6723180025 = 368228^2 + 81995^2 .
It is an emirp because it is prime and its reverse (900040513241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142315040009 - 28 = 142315039753 is a prime.
It is a super-2 number, since 2×1423150400092 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (142315040069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71157520004 + 71157520005.
It is an arithmetic number, because the mean of its divisors is an integer number (71157520005).
Almost surely, 2142315040009 is an apocalyptic number.
It is an amenable number.
142315040009 is a deficient number, since it is larger than the sum of its proper divisors (1).
142315040009 is an equidigital number, since it uses as much as digits as its factorization.
142315040009 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4320, while the sum is 29.
The spelling of 142315040009 in words is "one hundred forty-two billion, three hundred fifteen million, forty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •