Base | Representation |
---|---|
bin | 1011111100111010100110… |
… | …1010001000011100110111 |
3 | 1201112021121102200011220201 |
4 | 2333032221222020130313 |
5 | 3210301034221241011 |
6 | 43540543411541331 |
7 | 2524262660324041 |
oct | 277165152103467 |
9 | 51467542604821 |
10 | 13141151352631 |
11 | 4207149393135 |
12 | 1582a14bba847 |
13 | 744288c3b053 |
14 | 33606c51ca91 |
15 | 17bc714d4cc1 |
hex | bf3a9a88737 |
13141151352631 has 4 divisors (see below), whose sum is σ = 13141248550200. Its totient is φ = 13141054155064.
The previous prime is 13141151352583. The next prime is 13141151352643. The reversal of 13141151352631 is 13625315114131.
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 13141151352631 - 27 = 13141151352503 is a prime.
It is a super-2 number, since 2×131411513526312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13141151352431) 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, 48395701 + ... + 48666478.
It is an arithmetic number, because the mean of its divisors is an integer number (3285312137550).
Almost surely, 213141151352631 is an apocalyptic number.
13141151352631 is a deficient number, since it is larger than the sum of its proper divisors (97197569).
13141151352631 is an equidigital number, since it uses as much as digits as its factorization.
13141151352631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97197568.
The product of its digits is 32400, while the sum is 37.
Adding to 13141151352631 its reverse (13625315114131), we get a palindrome (26766466466762).
The spelling of 13141151352631 in words is "thirteen trillion, one hundred forty-one billion, one hundred fifty-one million, three hundred fifty-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •