Base | Representation |
---|---|
bin | 101101111011101000100110… |
… | …110101010111011111101111 |
3 | 222111020222111012221011102110 |
4 | 231323220212311113133233 |
5 | 202434213233142333033 |
6 | 1553350102333055103 |
7 | 60356515445541300 |
oct | 5573504665273757 |
9 | 874228435834373 |
10 | 202010143324143 |
11 | 59404025570750 |
12 | 1a7a6b04327493 |
13 | 8894623112aab |
14 | 37c54b36a47a7 |
15 | 1854b327db363 |
hex | b7ba26d577ef |
202010143324143 has 24 divisors (see below), whose sum is σ = 341805659950080. Its totient is φ = 104940334193520.
The previous prime is 202010143324079. The next prime is 202010143324183. The reversal of 202010143324143 is 341423341010202.
It is not a de Polignac number, because 202010143324143 - 26 = 202010143324079 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 202010143324143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (202010143324183) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 62464483023 + ... + 62464486256.
It is an arithmetic number, because the mean of its divisors is an integer number (14241902497920).
Almost surely, 2202010143324143 is an apocalyptic number.
202010143324143 is a deficient number, since it is larger than the sum of its proper divisors (139795516625937).
202010143324143 is a wasteful number, since it uses less digits than its factorization.
202010143324143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124928969307 (or 124928969300 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 202010143324143 its reverse (341423341010202), we get a palindrome (543433484334345).
The spelling of 202010143324143 in words is "two hundred two trillion, ten billion, one hundred forty-three million, three hundred twenty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •