Base | Representation |
---|---|
bin | 1100100011011110100… |
… | …1100010010101001000 |
3 | 202121201020201211120122 |
4 | 3020313221202111020 |
5 | 12013204043001300 |
6 | 243025525442412 |
7 | 21403541516132 |
oct | 3106751422510 |
9 | 677636654518 |
10 | 215682000200 |
11 | 83519959047 |
12 | 35973570408 |
13 | 17453244734 |
14 | a620b16052 |
15 | 59250a2c85 |
hex | 3237a62548 |
215682000200 has 24 divisors (see below), whose sum is σ = 501460650930. Its totient is φ = 86272800000.
The previous prime is 215682000197. The next prime is 215682000251. The reversal of 215682000200 is 2000286512.
It can be written as a sum of positive squares in 3 ways, for example, as 155783353636 + 59898646564 = 394694^2 + 244742^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 215682000200.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 539204801 + ... + 539205200.
Almost surely, 2215682000200 is an apocalyptic number.
215682000200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
215682000200 is an abundant number, since it is smaller than the sum of its proper divisors (285778650730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
215682000200 is a wasteful number, since it uses less digits than its factorization.
215682000200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1078410017 (or 1078410008 counting only the distinct ones).
The product of its (nonzero) digits is 1920, while the sum is 26.
Adding to 215682000200 its reverse (2000286512), we get a palindrome (217682286712).
The spelling of 215682000200 in words is "two hundred fifteen billion, six hundred eighty-two million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •