Base | Representation |
---|---|
bin | 1011101001010000011… |
… | …1100110100110011111 |
3 | 201010101001222121121112 |
4 | 2322110013212212133 |
5 | 11234202200013303 |
6 | 231523041052235 |
7 | 20311340556245 |
oct | 2722407464637 |
9 | 633331877545 |
10 | 200053516703 |
11 | 77929aa4087 |
12 | 3293162707b |
13 | 15b32439171 |
14 | 997b252795 |
15 | 530cee60d8 |
hex | 2e941e699f |
200053516703 has 4 divisors (see below), whose sum is σ = 200082698640. Its totient is φ = 200024334768.
The previous prime is 200053516669. The next prime is 200053516723. The reversal of 200053516703 is 307615350002.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 307615350002 = 2 ⋅153807675001.
It is a cyclic number.
It is not a de Polignac number, because 200053516703 - 220 = 200052468127 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 200053516703.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200053516723) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14580683 + ... + 14594396.
It is an arithmetic number, because the mean of its divisors is an integer number (50020674660).
Almost surely, 2200053516703 is an apocalyptic number.
200053516703 is a deficient number, since it is larger than the sum of its proper divisors (29181937).
200053516703 is an equidigital number, since it uses as much as digits as its factorization.
200053516703 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29181936.
The product of its (nonzero) digits is 18900, while the sum is 32.
Adding to 200053516703 its reverse (307615350002), we get a palindrome (507668866705).
The spelling of 200053516703 in words is "two hundred billion, fifty-three million, five hundred sixteen thousand, seven hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •