Base | Representation |
---|---|
bin | 1011111010110001101101… |
… | …1010011010101101111001 |
3 | 1201101202202112011200000001 |
4 | 2332230123122122231321 |
5 | 3204200310203130410 |
6 | 43512025224513001 |
7 | 2521522242512662 |
oct | 276543332325571 |
9 | 51352675150001 |
10 | 13104405130105 |
11 | 41a2602079293 |
12 | 157787a91b761 |
13 | 740981005c03 |
14 | 334384138369 |
15 | 17ad204c033a |
hex | beb1b69ab79 |
13104405130105 has 8 divisors (see below), whose sum is σ = 15725761568064. Its totient is φ = 10483207162800.
The previous prime is 13104405130039. The next prime is 13104405130121. The reversal of 13104405130105 is 50103150440131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13104405130105 - 211 = 13104405128057 is a prime.
It is a super-2 number, since 2×131044051301052 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39435661 + ... + 39766570.
It is an arithmetic number, because the mean of its divisors is an integer number (1965720196008).
Almost surely, 213104405130105 is an apocalyptic number.
It is an amenable number.
13104405130105 is a deficient number, since it is larger than the sum of its proper divisors (2621356437959).
13104405130105 is an equidigital number, since it uses as much as digits as its factorization.
13104405130105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 79235327.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 13104405130105 its reverse (50103150440131), we get a palindrome (63207555570236).
The spelling of 13104405130105 in words is "thirteen trillion, one hundred four billion, four hundred five million, one hundred thirty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •