Base | Representation |
---|---|
bin | 101110001100000101011001… |
… | …000000111000101111010111 |
3 | 222122021001022000100121222221 |
4 | 232030011121000320233113 |
5 | 203111223332232303133 |
6 | 2000013252524003211 |
7 | 60534264326431204 |
oct | 5614053100705727 |
9 | 878231260317887 |
10 | 203140561603543 |
11 | 597aa479186223 |
12 | 1a94a003090507 |
13 | 89470c3b24955 |
14 | 38240ac978cab |
15 | 187424398aa2d |
hex | b8c159038bd7 |
203140561603543 has 2 divisors, whose sum is σ = 203140561603544. Its totient is φ = 203140561603542.
The previous prime is 203140561603541. The next prime is 203140561603663. The reversal of 203140561603543 is 345306165041302.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 203140561603543 - 21 = 203140561603541 is a prime.
Together with 203140561603541, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 203140561603543.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (203140561603541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 101570280801771 + 101570280801772.
It is an arithmetic number, because the mean of its divisors is an integer number (101570280801772).
Almost surely, 2203140561603543 is an apocalyptic number.
203140561603543 is a deficient number, since it is larger than the sum of its proper divisors (1).
203140561603543 is an equidigital number, since it uses as much as digits as its factorization.
203140561603543 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 777600, while the sum is 43.
The spelling of 203140561603543 in words is "two hundred three trillion, one hundred forty billion, five hundred sixty-one million, six hundred three thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •