Base | Representation |
---|---|
bin | 10111011110010110001… |
… | …011110110011110110101 |
3 | 12201012202222020210120121 |
4 | 113132112023312132311 |
5 | 202412143400101031 |
6 | 3233021322131541 |
7 | 224354632242556 |
oct | 27362613663665 |
9 | 5635688223517 |
10 | 1613132425141 |
11 | 572142221906 |
12 | 220776950bb1 |
13 | b916b8822c3 |
14 | 5810c88832d |
15 | 2be64493011 |
hex | 177962f67b5 |
1613132425141 has 4 divisors (see below), whose sum is σ = 1613160470572. Its totient is φ = 1613104379712.
The previous prime is 1613132425061. The next prime is 1613132425241. The reversal of 1613132425141 is 1415242313161.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1087579922641 + 525552502500 = 1042871^2 + 724950^2 .
It is a cyclic number.
It is not a de Polignac number, because 1613132425141 - 211 = 1613132423093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1613132425097 and 1613132425106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1613132425241) 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, 13936260 + ... + 14051533.
It is an arithmetic number, because the mean of its divisors is an integer number (403290117643).
Almost surely, 21613132425141 is an apocalyptic number.
It is an amenable number.
1613132425141 is a deficient number, since it is larger than the sum of its proper divisors (28045431).
1613132425141 is an equidigital number, since it uses as much as digits as its factorization.
1613132425141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28045430.
The product of its digits is 17280, while the sum is 34.
The spelling of 1613132425141 in words is "one trillion, six hundred thirteen billion, one hundred thirty-two million, four hundred twenty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •