Base | Representation |
---|---|
bin | 11000010000001111… |
… | …00110001100111111 |
3 | 1020121110111222110012 |
4 | 30020013212030333 |
5 | 203131401023403 |
6 | 5552023333435 |
7 | 640450422020 |
oct | 141007461477 |
9 | 36543458405 |
10 | 13021111103 |
11 | 5582094550 |
12 | 26348b127b |
13 | 12c6883a90 |
14 | 8b74a2c47 |
15 | 513221ed8 |
hex | 3081e633f |
13021111103 has 32 divisors (see below), whose sum is σ = 18403069440. Its totient is φ = 8872882560.
The previous prime is 13021111069. The next prime is 13021111139. The reversal of 13021111103 is 30111112031.
It is a happy number.
13021111103 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13021111103 - 26 = 13021111039 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13021111153) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 323300 + ... + 361337.
It is an arithmetic number, because the mean of its divisors is an integer number (575095920).
Almost surely, 213021111103 is an apocalyptic number.
13021111103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
13021111103 is a deficient number, since it is larger than the sum of its proper divisors (5381958337).
13021111103 is a wasteful number, since it uses less digits than its factorization.
13021111103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 684687.
The product of its (nonzero) digits is 18, while the sum is 14.
Adding to 13021111103 its reverse (30111112031), we get a palindrome (43132223134).
The spelling of 13021111103 in words is "thirteen billion, twenty-one million, one hundred eleven thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •