Base | Representation |
---|---|
bin | 1011111011001000000011… |
… | …0011001110100101001110 |
3 | 1201102100020101122111120012 |
4 | 2332302000303032211032 |
5 | 3204300100140200420 |
6 | 43514500215153222 |
7 | 2522123650435046 |
oct | 276620063164516 |
9 | 51370211574505 |
10 | 13110401100110 |
11 | 41a50a96a72a6 |
12 | 1578a72975812 |
13 | 7413c82c0562 |
14 | 3347925b8726 |
15 | 17b071aaddc5 |
hex | bec80cce94e |
13110401100110 has 8 divisors (see below), whose sum is σ = 23598721980216. Its totient is φ = 5244160440040.
The previous prime is 13110401100107. The next prime is 13110401100119. The reversal of 13110401100110 is 1100110401131.
It is a happy number.
13110401100110 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13110401100119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 655520054996 + ... + 655520055015.
It is an arithmetic number, because the mean of its divisors is an integer number (2949840247527).
Almost surely, 213110401100110 is an apocalyptic number.
13110401100110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13110401100110 is a deficient number, since it is larger than the sum of its proper divisors (10488320880106).
13110401100110 is a wasteful number, since it uses less digits than its factorization.
13110401100110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1311040110018.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 13110401100110 its reverse (1100110401131), we get a palindrome (14210511501241).
The spelling of 13110401100110 in words is "thirteen trillion, one hundred ten billion, four hundred one million, one hundred thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •