Base | Representation |
---|---|
bin | 101101100001100101101110… |
… | …011000011100101000101111 |
3 | 222020220212200220121200201010 |
4 | 231201211232120130220233 |
5 | 202220402230114341033 |
6 | 1545455542214320303 |
7 | 60113304506310606 |
oct | 5541455630345057 |
9 | 866825626550633 |
10 | 200220342340143 |
11 | 58883a74576804 |
12 | 1a558063659093 |
13 | 879490ab894c8 |
14 | 3762a05662a3d |
15 | 18232cd353863 |
hex | b6196e61ca2f |
200220342340143 has 24 divisors (see below), whose sum is σ = 292747152351888. Its totient is φ = 121296434549248.
The previous prime is 200220342340069. The next prime is 200220342340147. The reversal of 200220342340143 is 341043243022002.
It is not a de Polignac number, because 200220342340143 - 28 = 200220342339887 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200220342340143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200220342340147) 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, 2334017196 + ... + 2334102977.
It is an arithmetic number, because the mean of its divisors is an integer number (12197798014662).
Almost surely, 2200220342340143 is an apocalyptic number.
200220342340143 is a deficient number, since it is larger than the sum of its proper divisors (92526810011745).
200220342340143 is a wasteful number, since it uses less digits than its factorization.
200220342340143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4668120251 (or 4668120222 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 30.
Adding to 200220342340143 its reverse (341043243022002), we get a palindrome (541263585362145).
The spelling of 200220342340143 in words is "two hundred trillion, two hundred twenty billion, three hundred forty-two million, three hundred forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •