Base | Representation |
---|---|
bin | 1011111010110101011011… |
… | …0001101111111111100111 |
3 | 1201101212022221021022000112 |
4 | 2332231112301233333213 |
5 | 3204204330140233221 |
6 | 43512312124003235 |
7 | 2521556025240020 |
oct | 276552661577747 |
9 | 51355287238015 |
10 | 13105401102311 |
11 | 41a2a732a0a11 |
12 | 1577ab839051b |
13 | 740aac46298b |
14 | 33443a517c47 |
15 | 17ad7cb5815b |
hex | beb56c6ffe7 |
13105401102311 has 8 divisors (see below), whose sum is σ = 14990479688064. Its totient is φ = 11223542123640.
The previous prime is 13105401102289. The next prime is 13105401102317. The reversal of 13105401102311 is 11320110450131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-13105401102311 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13105401102317) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 804893045 + ... + 804909326.
It is an arithmetic number, because the mean of its divisors is an integer number (1873809961008).
Almost surely, 213105401102311 is an apocalyptic number.
13105401102311 is a deficient number, since it is larger than the sum of its proper divisors (1885078585753).
13105401102311 is a wasteful number, since it uses less digits than its factorization.
13105401102311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1609803541.
The product of its (nonzero) digits is 360, while the sum is 23.
Adding to 13105401102311 its reverse (11320110450131), we get a palindrome (24425511552442).
The spelling of 13105401102311 in words is "thirteen trillion, one hundred five billion, four hundred one million, one hundred two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •