Base | Representation |
---|---|
bin | 1000010100001011110… |
… | …0110010000011111001 |
3 | 111122201221221011200222 |
4 | 2011002330302003321 |
5 | 4320032412310323 |
6 | 145343324305425 |
7 | 13215063513524 |
oct | 2050274620371 |
9 | 448657834628 |
10 | 142857150713 |
11 | 55649156822 |
12 | 2382a6a2275 |
13 | 106187ac314 |
14 | 6cb2c8bbbb |
15 | 3ab19999c8 |
hex | 2142f320f9 |
142857150713 has 2 divisors, whose sum is σ = 142857150714. Its totient is φ = 142857150712.
The previous prime is 142857150697. The next prime is 142857150757. The reversal of 142857150713 is 317051758241.
It is an a-pointer prime, because the next prime (142857150757) can be obtained adding 142857150713 to its sum of digits (44).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123170815849 + 19686334864 = 350957^2 + 140308^2 .
It is an emirp because it is prime and its reverse (317051758241) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 142857150713 - 24 = 142857150697 is a prime.
It is not a weakly prime, because it can be changed into another prime (142857150773) 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, 71428575356 + 71428575357.
It is an arithmetic number, because the mean of its divisors is an integer number (71428575357).
Almost surely, 2142857150713 is an apocalyptic number.
It is an amenable number.
142857150713 is a deficient number, since it is larger than the sum of its proper divisors (1).
142857150713 is an equidigital number, since it uses as much as digits as its factorization.
142857150713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 235200, while the sum is 44.
The spelling of 142857150713 in words is "one hundred forty-two billion, eight hundred fifty-seven million, one hundred fifty thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •