Base | Representation |
---|---|
bin | 1011111010100001010110… |
… | …0000001100011111011110 |
3 | 1201101100102021212110001012 |
4 | 2332220111200030133132 |
5 | 3204112310304422420 |
6 | 43510021215415222 |
7 | 2521305325242116 |
oct | 276502540143736 |
9 | 51340367773035 |
10 | 13100011014110 |
11 | 41a0757778969 |
12 | 1576a53224512 |
13 | 740430853187 |
14 | 334088712046 |
15 | 17ab64849dc5 |
hex | bea1580c7de |
13100011014110 has 16 divisors (see below), whose sum is σ = 23844963870000. Its totient is φ = 5181127951296.
The previous prime is 13100011014109. The next prime is 13100011014113. The reversal of 13100011014110 is 1141011000131.
It is a happy number.
It is a super-2 number, since 2×131000110141102 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13100011014113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7359555860 + ... + 7359557639.
It is an arithmetic number, because the mean of its divisors is an integer number (1490310241875).
Almost surely, 213100011014110 is an apocalyptic number.
13100011014110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13100011014110 is a deficient number, since it is larger than the sum of its proper divisors (10744952855890).
13100011014110 is a wasteful number, since it uses less digits than its factorization.
13100011014110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14719113595.
The product of its (nonzero) digits is 12, while the sum is 14.
Adding to 13100011014110 its reverse (1141011000131), we get a palindrome (14241022014241).
The spelling of 13100011014110 in words is "thirteen trillion, one hundred billion, eleven million, fourteen thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •