Base | Representation |
---|---|
bin | 1011101011000000001… |
… | …1001110001001011111 |
3 | 201011120201202122020010 |
4 | 2322300003032021133 |
5 | 11241132131130030 |
6 | 232041341054303 |
7 | 20326060660644 |
oct | 2726003161137 |
9 | 634521678203 |
10 | 200522130015 |
11 | 7804a573209 |
12 | 32a42557393 |
13 | 15ba855204c |
14 | 99c3597dcb |
15 | 533920e6b0 |
hex | 2eb00ce25f |
200522130015 has 8 divisors (see below), whose sum is σ = 320835408048. Its totient is φ = 106945136000.
The previous prime is 200522129917. The next prime is 200522130037. The reversal of 200522130015 is 510031225002.
200522130015 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200522130015 - 213 = 200522121823 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200522129973 and 200522130000.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6684070986 + ... + 6684071015.
It is an arithmetic number, because the mean of its divisors is an integer number (40104426006).
Almost surely, 2200522130015 is an apocalyptic number.
200522130015 is a deficient number, since it is larger than the sum of its proper divisors (120313278033).
200522130015 is a wasteful number, since it uses less digits than its factorization.
200522130015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13368142009.
The product of its (nonzero) digits is 600, while the sum is 21.
Adding to 200522130015 its reverse (510031225002), we get a palindrome (710553355017).
The spelling of 200522130015 in words is "two hundred billion, five hundred twenty-two million, one hundred thirty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •