Base | Representation |
---|---|
bin | 1100000000011011100100… |
… | …0110100010110101101011 |
3 | 1201202001111000120101011211 |
4 | 3000012321012202311223 |
5 | 3212243223220014011 |
6 | 44024412002133551 |
7 | 2531531316344536 |
oct | 300067106426553 |
9 | 51661430511154 |
10 | 13201540001131 |
11 | 422a8181925a9 |
12 | 15926690512b7 |
13 | 749b91063a61 |
14 | 338d5a85da1d |
15 | 17d607e07b21 |
hex | c01b91a2d6b |
13201540001131 has 4 divisors (see below), whose sum is σ = 13201890835672. Its totient is φ = 13201189166592.
The previous prime is 13201540001113. The next prime is 13201540001137. The reversal of 13201540001131 is 13110004510231.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13201540001131 - 223 = 13201531612523 is a prime.
It is a super-2 number, since 2×132015400011312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13201540001137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 175360821 + ... + 175436086.
It is an arithmetic number, because the mean of its divisors is an integer number (3300472708918).
Almost surely, 213201540001131 is an apocalyptic number.
13201540001131 is a deficient number, since it is larger than the sum of its proper divisors (350834541).
13201540001131 is an equidigital number, since it uses as much as digits as its factorization.
13201540001131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 350834540.
The product of its (nonzero) digits is 360, while the sum is 22.
Adding to 13201540001131 its reverse (13110004510231), we get a palindrome (26311544511362).
The spelling of 13201540001131 in words is "thirteen trillion, two hundred one billion, five hundred forty million, one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •