Base | Representation |
---|---|
bin | 100000101010001111011010… |
… | …010101001001010001111011 |
3 | 200211120212121021211222001012 |
4 | 200222033122111021101323 |
5 | 122311400220042200001 |
6 | 1225255231041144135 |
7 | 42153444255651644 |
oct | 4052173225112173 |
9 | 624525537758035 |
10 | 143640254256251 |
11 | 4184a542919a95 |
12 | 1413a53a62b04b |
13 | 621c2aa82312c |
14 | 27683226dc6cb |
15 | 119162ca5a2bb |
hex | 82a3da54947b |
143640254256251 has 2 divisors, whose sum is σ = 143640254256252. Its totient is φ = 143640254256250.
The previous prime is 143640254256217. The next prime is 143640254256253. The reversal of 143640254256251 is 152652452046341.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-143640254256251 is a prime.
Together with 143640254256253, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 143640254256251.
It is not a weakly prime, because it can be changed into another prime (143640254256253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71820127128125 + 71820127128126.
It is an arithmetic number, because the mean of its divisors is an integer number (71820127128126).
Almost surely, 2143640254256251 is an apocalyptic number.
143640254256251 is a deficient number, since it is larger than the sum of its proper divisors (1).
143640254256251 is an equidigital number, since it uses as much as digits as its factorization.
143640254256251 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912000, while the sum is 50.
The spelling of 143640254256251 in words is "one hundred forty-three trillion, six hundred forty billion, two hundred fifty-four million, two hundred fifty-six thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •