Base | Representation |
---|---|
bin | 1011111010111001101001… |
… | …1011100010101100011001 |
3 | 1201101222021001000202011012 |
4 | 2332232122123202230121 |
5 | 3204214141222200403 |
6 | 43513020511343305 |
7 | 2521626116645420 |
oct | 276563233425431 |
9 | 51358231022135 |
10 | 13106536131353 |
11 | 41a34a5a61045 |
12 | 1578174521b35 |
13 | 740c306596b2 |
14 | 3345071742b7 |
15 | 17ade760ced8 |
hex | beb9a6e2b19 |
13106536131353 has 32 divisors (see below), whose sum is σ = 16097620089600. Its totient is φ = 10414950948864.
The previous prime is 13106536131349. The next prime is 13106536131389. The reversal of 13106536131353 is 35313163560131.
It is not a de Polignac number, because 13106536131353 - 22 = 13106536131349 is a prime.
It is a super-2 number, since 2×131065361313532 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13106536131353.
It is not an unprimeable number, because it can be changed into a prime (13106536131343) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 196971593 + ... + 197038121.
It is an arithmetic number, because the mean of its divisors is an integer number (503050627800).
Almost surely, 213106536131353 is an apocalyptic number.
It is an amenable number.
13106536131353 is a deficient number, since it is larger than the sum of its proper divisors (2991083958247).
13106536131353 is a wasteful number, since it uses less digits than its factorization.
13106536131353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91329.
The product of its (nonzero) digits is 218700, while the sum is 41.
Adding to 13106536131353 its reverse (35313163560131), we get a palindrome (48419699691484).
The spelling of 13106536131353 in words is "thirteen trillion, one hundred six billion, five hundred thirty-six million, one hundred thirty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •