Base | Representation |
---|---|
bin | 11101110010111101011110… |
… | …101001111010011110111101 |
3 | 122011222210220201122012111100 |
4 | 131302331132221322132331 |
5 | 114134021321303322023 |
6 | 1142413221303243313 |
7 | 36413466366341223 |
oct | 3562753651723675 |
9 | 564883821565440 |
10 | 131045335214013 |
11 | 38834018424440 |
12 | 12845569749539 |
13 | 58176a303bc3c |
14 | 24508b15b2b13 |
15 | 1023bcadb5c43 |
hex | 772f5ea7a7bd |
131045335214013 has 24 divisors (see below), whose sum is σ = 207636539868576. Its totient is φ = 78982622920800.
The previous prime is 131045335213999. The next prime is 131045335214047. The reversal of 131045335214013 is 310412533540131.
131045335214013 is a `hidden beast` number, since 1 + 3 + 1 + 0 + 453 + 3 + 52 + 140 + 13 = 666.
It is not a de Polignac number, because 131045335214013 - 24 = 131045335213997 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131045335214083) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3656584995 + ... + 3656620832.
It is an arithmetic number, because the mean of its divisors is an integer number (8651522494524).
Almost surely, 2131045335214013 is an apocalyptic number.
It is an amenable number.
131045335214013 is a deficient number, since it is larger than the sum of its proper divisors (76591204654563).
131045335214013 is a wasteful number, since it uses less digits than its factorization.
131045335214013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7313206025 (or 7313206022 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 36.
Adding to 131045335214013 its reverse (310412533540131), we get a palindrome (441457868754144).
The spelling of 131045335214013 in words is "one hundred thirty-one trillion, forty-five billion, three hundred thirty-five million, two hundred fourteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •