Base | Representation |
---|---|
bin | 111101001001000110… |
… | …1111011100110111001 |
3 | 110112220200011000222201 |
4 | 1322102031323212321 |
5 | 4122401322110231 |
6 | 140152552350201 |
7 | 12325534545556 |
oct | 1722215734671 |
9 | 415820130881 |
10 | 131302144441 |
11 | 50759701566 |
12 | 215449a5361 |
13 | c4c68b08c0 |
14 | 64d83c7a2d |
15 | 3637329161 |
hex | 1e9237b9b9 |
131302144441 has 4 divisors (see below), whose sum is σ = 141402309412. Its totient is φ = 121201979472.
The previous prime is 131302144423. The next prime is 131302144451. The reversal of 131302144441 is 144441203131.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 144441203131 = 4363 ⋅33105937.
It can be written as a sum of positive squares in 2 ways, for example, as 70704937216 + 60597207225 = 265904^2 + 246165^2 .
It is a cyclic number.
It is not a de Polignac number, because 131302144441 - 211 = 131302142393 is a prime.
It is not an unprimeable number, because it can be changed into a prime (131302144411) 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, 5050082466 + ... + 5050082491.
It is an arithmetic number, because the mean of its divisors is an integer number (35350577353).
Almost surely, 2131302144441 is an apocalyptic number.
It is an amenable number.
131302144441 is a deficient number, since it is larger than the sum of its proper divisors (10100164971).
131302144441 is a wasteful number, since it uses less digits than its factorization.
131302144441 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10100164970.
The product of its (nonzero) digits is 4608, while the sum is 28.
Adding to 131302144441 its reverse (144441203131), we get a palindrome (275743347572).
The spelling of 131302144441 in words is "one hundred thirty-one billion, three hundred two million, one hundred forty-four thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •