Base | Representation |
---|---|
bin | 100000010110101111001110… |
… | …110100101011100101001101 |
3 | 200122211202020212002201101022 |
4 | 200112233032310223211031 |
5 | 122122420431014302034 |
6 | 1222351422034123525 |
7 | 41654560301436461 |
oct | 4026571664534515 |
9 | 618752225081338 |
10 | 142300031400269 |
11 | 41383116a75866 |
12 | 13b628487205a5 |
13 | 6152ab2448ac2 |
14 | 271d5031344a1 |
15 | 116b83c7cbb2e |
hex | 816bced2b94d |
142300031400269 has 2 divisors, whose sum is σ = 142300031400270. Its totient is φ = 142300031400268.
The previous prime is 142300031400251. The next prime is 142300031400313. The reversal of 142300031400269 is 962004130003241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 84886647426025 + 57413383974244 = 9213395^2 + 7577162^2 .
It is a cyclic number.
It is not a de Polignac number, because 142300031400269 - 220 = 142300030351693 is a prime.
It is a super-2 number, since 2×1423000314002692 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142300031400229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71150015700134 + 71150015700135.
It is an arithmetic number, because the mean of its divisors is an integer number (71150015700135).
Almost surely, 2142300031400269 is an apocalyptic number.
It is an amenable number.
142300031400269 is a deficient number, since it is larger than the sum of its proper divisors (1).
142300031400269 is an equidigital number, since it uses as much as digits as its factorization.
142300031400269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 35.
The spelling of 142300031400269 in words is "one hundred forty-two trillion, three hundred billion, thirty-one million, four hundred thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •