Base | Representation |
---|---|
bin | 11000011100001010… |
… | …00110011101101110 |
3 | 1020212102200222000111 |
4 | 30032011012131232 |
5 | 203333001320420 |
6 | 10005555050234 |
7 | 643103452330 |
oct | 141605063556 |
9 | 36772628014 |
10 | 13121120110 |
11 | 562359181a |
12 | 26622a097a |
13 | 13114cb6c7 |
14 | 8c6897450 |
15 | 51bdc945a |
hex | 30e14676e |
13121120110 has 32 divisors (see below), whose sum is σ = 26995991040. Its totient is φ = 4498007712.
The previous prime is 13121120107. The next prime is 13121120119. The reversal of 13121120110 is 1102112131.
It is a happy number.
13121120110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13121120119) 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 15 ways as a sum of consecutive naturals, for example, 840597 + ... + 856063.
It is an arithmetic number, because the mean of its divisors is an integer number (843624720).
Almost surely, 213121120110 is an apocalyptic number.
13121120110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13121120110 is an abundant number, since it is smaller than the sum of its proper divisors (13874870930).
13121120110 is a wasteful number, since it uses less digits than its factorization.
13121120110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27600.
The product of its (nonzero) digits is 12, while the sum is 13.
Adding to 13121120110 its reverse (1102112131), we get a palindrome (14223232241).
It can be divided in two parts, 131211 and 20110, that added together give a square (151321 = 3892).
The spelling of 13121120110 in words is "thirteen billion, one hundred twenty-one million, one hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •