Base | Representation |
---|---|
bin | 1011101011000111000… |
… | …1011101111010001111 |
3 | 201011122202010221010022 |
4 | 2322301301131322033 |
5 | 11241212030433130 |
6 | 232044252332355 |
7 | 20326561426451 |
oct | 2726161357217 |
9 | 634582127108 |
10 | 200551030415 |
11 | 7806491253a |
12 | 32a501740bb |
13 | 15bb1530688 |
14 | 99c735c2d1 |
15 | 533ba1c7e5 |
hex | 2eb1c5de8f |
200551030415 has 4 divisors (see below), whose sum is σ = 240661236504. Its totient is φ = 160440824328.
The previous prime is 200551030409. The next prime is 200551030439. The reversal of 200551030415 is 514030155002.
200551030415 is digitally balanced in base 11, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 200551030415 - 214 = 200551014031 is a prime.
It is a Duffinian number.
200551030415 is strictly pandigital in base 11.
It is a congruent number.
It is an unprimeable number.
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, 20055103037 + ... + 20055103046.
It is an arithmetic number, because the mean of its divisors is an integer number (60165309126).
Almost surely, 2200551030415 is an apocalyptic number.
200551030415 is a deficient number, since it is larger than the sum of its proper divisors (40110206089).
200551030415 is an equidigital number, since it uses as much as digits as its factorization.
200551030415 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40110206088.
The product of its (nonzero) digits is 3000, while the sum is 26.
Adding to 200551030415 its reverse (514030155002), we get a palindrome (714581185417).
The spelling of 200551030415 in words is "two hundred billion, five hundred fifty-one million, thirty thousand, four hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •