Base | Representation |
---|---|
bin | 100000100100101110100000… |
… | …111111000110000000000101 |
3 | 200210020122112202111222202011 |
4 | 200210232200333012000011 |
5 | 122234143203233133133 |
6 | 1224405203155414221 |
7 | 42114201301605463 |
oct | 4044564077060005 |
9 | 623218482458664 |
10 | 143261335052293 |
11 | 41713877904787 |
12 | 1409900b2b4371 |
13 | 61c2641778403 |
14 | 2753c581a1833 |
15 | 1186851c1d6cd |
hex | 824ba0fc6005 |
143261335052293 has 2 divisors, whose sum is σ = 143261335052294. Its totient is φ = 143261335052292.
The previous prime is 143261335052239. The next prime is 143261335052333. The reversal of 143261335052293 is 392250533162341.
Together with previous prime (143261335052239) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 140749797895204 + 2511537157089 = 11863802^2 + 1584783^2 .
It is a cyclic number.
It is not a de Polignac number, because 143261335052293 - 221 = 143261332955141 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (143261335052593) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 71630667526146 + 71630667526147.
It is an arithmetic number, because the mean of its divisors is an integer number (71630667526147).
Almost surely, 2143261335052293 is an apocalyptic number.
It is an amenable number.
143261335052293 is a deficient number, since it is larger than the sum of its proper divisors (1).
143261335052293 is an equidigital number, since it uses as much as digits as its factorization.
143261335052293 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3499200, while the sum is 49.
The spelling of 143261335052293 in words is "one hundred forty-three trillion, two hundred sixty-one billion, three hundred thirty-five million, fifty-two thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •