Base | Representation |
---|---|
bin | 11101110010111011101110… |
… | …011111000010100000100111 |
3 | 122011222122001120111211112000 |
4 | 131302323232133002200213 |
5 | 114134003443022040421 |
6 | 1142412310435500343 |
7 | 36413401635431421 |
oct | 3562735637024047 |
9 | 564878046454460 |
10 | 131043453315111 |
11 | 38833242111997 |
12 | 128451234576b3 |
13 | 58174631a53ac |
14 | 245077369b811 |
15 | 1023b1aa81226 |
hex | 772eee7c2827 |
131043453315111 has 8 divisors (see below), whose sum is σ = 194138449355760. Its totient is φ = 87362302210056.
The previous prime is 131043453314957. The next prime is 131043453315133. The reversal of 131043453315111 is 111513354340131.
131043453315111 is a `hidden beast` number, since 1 + 3 + 1 + 0 + 4 + 3 + 4 + 533 + 1 + 5 + 111 = 666.
It is not a de Polignac number, because 131043453315111 - 225 = 131043419760679 is a prime.
It is a super-2 number, since 2×1310434533151112 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131043453315191) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2426730616920 + ... + 2426730616973.
It is an arithmetic number, because the mean of its divisors is an integer number (24267306169470).
Almost surely, 2131043453315111 is an apocalyptic number.
131043453315111 is a deficient number, since it is larger than the sum of its proper divisors (63094996040649).
131043453315111 is an equidigital number, since it uses as much as digits as its factorization.
131043453315111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4853461233902 (or 4853461233896 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 36.
The spelling of 131043453315111 in words is "one hundred thirty-one trillion, forty-three billion, four hundred fifty-three million, three hundred fifteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •