Base | Representation |
---|---|
bin | 1011101011011001111… |
… | …1100011011011100001 |
3 | 201011212021011012111220 |
4 | 2322312133203123201 |
5 | 11241342314024023 |
6 | 232100201525253 |
7 | 20331542510412 |
oct | 2726637433341 |
9 | 634767135456 |
10 | 200630220513 |
11 | 780a55901a8 |
12 | 32a727a3829 |
13 | 15bc4a69218 |
14 | 99d3a93809 |
15 | 53439613e3 |
hex | 2eb67e36e1 |
200630220513 has 4 divisors (see below), whose sum is σ = 267506960688. Its totient is φ = 133753480340.
The previous prime is 200630220481. The next prime is 200630220521. The reversal of 200630220513 is 315022036002.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 200630220513 - 25 = 200630220481 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (200630220113) 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 in 3 ways as a sum of consecutive naturals, for example, 33438370083 + ... + 33438370088.
It is an arithmetic number, because the mean of its divisors is an integer number (66876740172).
Almost surely, 2200630220513 is an apocalyptic number.
It is an amenable number.
200630220513 is a deficient number, since it is larger than the sum of its proper divisors (66876740175).
200630220513 is an equidigital number, since it uses as much as digits as its factorization.
200630220513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66876740174.
The product of its (nonzero) digits is 2160, while the sum is 24.
Adding to 200630220513 its reverse (315022036002), we get a palindrome (515652256515).
The spelling of 200630220513 in words is "two hundred billion, six hundred thirty million, two hundred twenty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •