Base | Representation |
---|---|
bin | 11000101000000101… |
… | …00000011000000110 |
3 | 1021010101211121220120 |
4 | 30110002200120012 |
5 | 204034100244420 |
6 | 10023530042410 |
7 | 645426344055 |
oct | 142402403006 |
9 | 37111747816 |
10 | 13221103110 |
11 | 5674a714a6 |
12 | 268b879406 |
13 | 1329137547 |
14 | 8d5c8239c |
15 | 525a78d40 |
hex | 3140a0606 |
13221103110 has 64 divisors (see below), whose sum is σ = 33126700032. Its totient is φ = 3370663296.
The previous prime is 13221103079. The next prime is 13221103141. The reversal of 13221103110 is 1130112231.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13221103079) and next prime (13221103141).
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13221103110.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1988712 + ... + 1995348.
It is an arithmetic number, because the mean of its divisors is an integer number (517604688).
Almost surely, 213221103110 is an apocalyptic number.
13221103110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13221103110 is an abundant number, since it is smaller than the sum of its proper divisors (19905596922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13221103110 is a wasteful number, since it uses less digits than its factorization.
13221103110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9557.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 13221103110 its reverse (1130112231), we get a palindrome (14351215341).
The spelling of 13221103110 in words is "thirteen billion, two hundred twenty-one million, one hundred three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •