Base | Representation |
---|---|
bin | 111101000000101110… |
… | …1011101111000110101 |
3 | 110112012002010122021102 |
4 | 1322001131131320311 |
5 | 4121312334114331 |
6 | 140105030455445 |
7 | 12315552106253 |
oct | 1720135357065 |
9 | 415162118242 |
10 | 131021004341 |
11 | 50624a39877 |
12 | 21486804585 |
13 | c480587306 |
14 | 64acd235d3 |
15 | 361c7e34cb |
hex | 1e8175de35 |
131021004341 has 4 divisors (see below), whose sum is σ = 135247488384. Its totient is φ = 126794520300.
The previous prime is 131021004319. The next prime is 131021004347. The reversal of 131021004341 is 143400120131.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 143400120131 = 769 ⋅186476099.
It is a cyclic number.
It is not a de Polignac number, because 131021004341 - 210 = 131021003317 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 (131021004347) 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, 2113241975 + ... + 2113242036.
It is an arithmetic number, because the mean of its divisors is an integer number (33811872096).
Almost surely, 2131021004341 is an apocalyptic number.
It is an amenable number.
131021004341 is a deficient number, since it is larger than the sum of its proper divisors (4226484043).
131021004341 is an equidigital number, since it uses as much as digits as its factorization.
131021004341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4226484042.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 131021004341 its reverse (143400120131), we get a palindrome (274421124472).
The spelling of 131021004341 in words is "one hundred thirty-one billion, twenty-one million, four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •