Base | Representation |
---|---|
bin | 100000011011000111001100… |
… | …110100010010110110010101 |
3 | 200200220111012011110222012121 |
4 | 200123013030310102312111 |
5 | 122142332110214032003 |
6 | 1223141455424415541 |
7 | 42015361633646656 |
oct | 4033071464226625 |
9 | 620814164428177 |
10 | 142600645455253 |
11 | 4148965984a717 |
12 | 13bb0b637775b1 |
13 | 617524c55474b |
14 | 272dc9da3b52d |
15 | 1174583d32cbd |
hex | 81b1ccd12d95 |
142600645455253 has 2 divisors, whose sum is σ = 142600645455254. Its totient is φ = 142600645455252.
The previous prime is 142600645455227. The next prime is 142600645455293. The reversal of 142600645455253 is 352554546006241.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 132499391462244 + 10101253993009 = 11510838^2 + 3178247^2 .
It is a cyclic number.
It is not a de Polignac number, because 142600645455253 - 25 = 142600645455221 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 142600645455253.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (142600645455293) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71300322727626 + 71300322727627.
It is an arithmetic number, because the mean of its divisors is an integer number (71300322727627).
Almost surely, 2142600645455253 is an apocalyptic number.
It is an amenable number.
142600645455253 is a deficient number, since it is larger than the sum of its proper divisors (1).
142600645455253 is an equidigital number, since it uses as much as digits as its factorization.
142600645455253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17280000, while the sum is 52.
The spelling of 142600645455253 in words is "one hundred forty-two trillion, six hundred billion, six hundred forty-five million, four hundred fifty-five thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •