Base | Representation |
---|---|
bin | 1000010111010100110… |
… | …1000110011011100101 |
3 | 111201220201110001100022 |
4 | 2011311031012123211 |
5 | 4323244233224003 |
6 | 150003123524525 |
7 | 13245012206423 |
oct | 2056515063345 |
9 | 451821401308 |
10 | 143700289253 |
11 | 55a41081234 |
12 | 23a24b29745 |
13 | 10721387471 |
14 | 6d52c46113 |
15 | 3b109e3738 |
hex | 21753466e5 |
143700289253 has 2 divisors, whose sum is σ = 143700289254. Its totient is φ = 143700289252.
The previous prime is 143700289219. The next prime is 143700289273. The reversal of 143700289253 is 352982007341.
It is a happy number.
143700289253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 143415962209 + 284327044 = 378703^2 + 16862^2 .
It is a cyclic number.
It is not a de Polignac number, because 143700289253 - 214 = 143700272869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143700289273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71850144626 + 71850144627.
It is an arithmetic number, because the mean of its divisors is an integer number (71850144627).
Almost surely, 2143700289253 is an apocalyptic number.
It is an amenable number.
143700289253 is a deficient number, since it is larger than the sum of its proper divisors (1).
143700289253 is an equidigital number, since it uses as much as digits as its factorization.
143700289253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 44.
The spelling of 143700289253 in words is "one hundred forty-three billion, seven hundred million, two hundred eighty-nine thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •