Base | Representation |
---|---|
bin | 100000011001101010100101… |
… | …011100100000101001001101 |
3 | 200200112222111200120000011021 |
4 | 200121222211130200221031 |
5 | 122134214424332123234 |
6 | 1223024051533354141 |
7 | 42005241411104215 |
oct | 4031524534405115 |
9 | 620488450500137 |
10 | 142501200661069 |
11 | 414504688579a8 |
12 | 13b9582b938951 |
13 | 6168a61a88b73 |
14 | 2729148623245 |
15 | 1171bb37189b4 |
hex | 819aa5720a4d |
142501200661069 has 2 divisors, whose sum is σ = 142501200661070. Its totient is φ = 142501200661068.
The previous prime is 142501200660991. The next prime is 142501200661123. The reversal of 142501200661069 is 960166002105241.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 96589328472169 + 45911872188900 = 9827987^2 + 6775830^2 .
It is a cyclic number.
It is not a de Polignac number, because 142501200661069 - 241 = 140302177405517 is a prime.
It is a super-3 number, since 3×1425012006610693 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142501200961069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71250600330534 + 71250600330535.
It is an arithmetic number, because the mean of its divisors is an integer number (71250600330535).
Almost surely, 2142501200661069 is an apocalyptic number.
It is an amenable number.
142501200661069 is a deficient number, since it is larger than the sum of its proper divisors (1).
142501200661069 is an equidigital number, since it uses as much as digits as its factorization.
142501200661069 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 155520, while the sum is 43.
The spelling of 142501200661069 in words is "one hundred forty-two trillion, five hundred one billion, two hundred million, six hundred sixty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •