Base | Representation |
---|---|
bin | 1011111010110101011100… |
… | …0010101001000000010100 |
3 | 1201101212100020121020211220 |
4 | 2332231113002221000110 |
5 | 3204204332303431012 |
6 | 43512312402530340 |
7 | 2521556111001066 |
oct | 276552702510024 |
9 | 51355306536756 |
10 | 13105405530132 |
11 | 41a2a75845673 |
12 | 1577ab99669b0 |
13 | 740ab03531a6 |
14 | 33443ad4b736 |
15 | 17ad7d23008c |
hex | beb570a9014 |
13105405530132 has 24 divisors (see below), whose sum is σ = 30581956882176. Its totient is φ = 4368086036928.
The previous prime is 13105405530127. The next prime is 13105405530163. The reversal of 13105405530132 is 23103550450131.
It is a junction number, because it is equal to n+sod(n) for n = 13105405530093 and 13105405530102.
It is a congruent 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, 47666353 + ... + 47940504.
It is an arithmetic number, because the mean of its divisors is an integer number (1274248203424).
Almost surely, 213105405530132 is an apocalyptic number.
13105405530132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13105405530132 is an abundant number, since it is smaller than the sum of its proper divisors (17476551352044).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13105405530132 is a wasteful number, since it uses less digits than its factorization.
13105405530132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95618287 (or 95618285 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 13105405530132 its reverse (23103550450131), we get a palindrome (36208955980263).
The spelling of 13105405530132 in words is "thirteen trillion, one hundred five billion, four hundred five million, five hundred thirty thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •