Base | Representation |
---|---|
bin | 11000011010110110… |
… | …11100011110001000 |
3 | 1020211200011011201101 |
4 | 30031123130132020 |
5 | 203322202401300 |
6 | 10004525031144 |
7 | 642611602006 |
oct | 141533343610 |
9 | 36750134641 |
10 | 13110200200 |
11 | 56184034a9 |
12 | 265a6b54b4 |
13 | 130c177216 |
14 | 8c5253a76 |
15 | 51ae6db6a |
hex | 30d6dc788 |
13110200200 has 48 divisors (see below), whose sum is σ = 30514045860. Its totient is φ = 5238432000.
The previous prime is 13110200189. The next prime is 13110200219. The reversal of 13110200200 is 200201131.
13110200200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 2194547716 + 10915652484 = 46846^2 + 104478^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
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 11 ways as a sum of consecutive naturals, for example, 153370 + ... + 223030.
Almost surely, 213110200200 is an apocalyptic number.
13110200200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13110200200 is an abundant number, since it is smaller than the sum of its proper divisors (17403845660).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13110200200 is a wasteful number, since it uses less digits than its factorization.
13110200200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70618 (or 70609 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 13110200200 its reverse (200201131), we get a palindrome (13310401331).
The spelling of 13110200200 in words is "thirteen billion, one hundred ten million, two hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •