Base | Representation |
---|---|
bin | 11101110010100110000110… |
… | …111011100011101111110111 |
3 | 122011220102010212200100220211 |
4 | 131302212012323203233313 |
5 | 114133113423211434333 |
6 | 1142353511242010251 |
7 | 36411620500162024 |
oct | 3562460673435767 |
9 | 564812125610824 |
10 | 131020241124343 |
11 | 3882441047345a |
12 | 128407257a6987 |
13 | 581520418117c |
14 | 244d5b093654b |
15 | 102320cd09ecd |
hex | 772986ee3bf7 |
131020241124343 has 4 divisors (see below), whose sum is σ = 131031857435040. Its totient is φ = 131008624813648.
The previous prime is 131020241124329. The next prime is 131020241124361. The reversal of 131020241124343 is 343421142020131.
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 131020241124343 - 233 = 131011651189751 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (131020241124313) 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, 5808138430 + ... + 5808160987.
It is an arithmetic number, because the mean of its divisors is an integer number (32757964358760).
Almost surely, 2131020241124343 is an apocalyptic number.
131020241124343 is a deficient number, since it is larger than the sum of its proper divisors (11616310697).
131020241124343 is a wasteful number, since it uses less digits than its factorization.
131020241124343 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11616310696.
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 131020241124343 its reverse (343421142020131), we get a palindrome (474441383144474).
The spelling of 131020241124343 in words is "one hundred thirty-one trillion, twenty billion, two hundred forty-one million, one hundred twenty-four thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •