Base | Representation |
---|---|
bin | 10011110011111001110… |
… | …100111000011110001101 |
3 | 11211011000101021020021122 |
4 | 103303321310320132031 |
5 | 134301122132230432 |
6 | 2521230301210325 |
7 | 200233534015025 |
oct | 23637164703615 |
9 | 4734011236248 |
10 | 1361401055117 |
11 | 485404449744 |
12 | 19ba225609a5 |
13 | 9b4c1bb240c |
14 | 49c6c146a85 |
15 | 2562e67a612 |
hex | 13cf9d3878d |
1361401055117 has 8 divisors (see below), whose sum is σ = 1370567698200. Its totient is φ = 1352234808640.
The previous prime is 1361401055099. The next prime is 1361401055167. The reversal of 1361401055117 is 7115501041631.
It can be written as a sum of positive squares in 4 ways, for example, as 162049722916 + 1199351332201 = 402554^2 + 1095149^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1361401055117 - 210 = 1361401054093 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 (1361401055167) 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, 10816367 + ... + 10941507.
It is an arithmetic number, because the mean of its divisors is an integer number (171320962275).
Almost surely, 21361401055117 is an apocalyptic number.
It is an amenable number.
1361401055117 is a deficient number, since it is larger than the sum of its proper divisors (9166643083).
1361401055117 is a wasteful number, since it uses less digits than its factorization.
1361401055117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 198303.
The product of its (nonzero) digits is 12600, while the sum is 35.
Adding to 1361401055117 its reverse (7115501041631), we get a palindrome (8476902096748).
The spelling of 1361401055117 in words is "one trillion, three hundred sixty-one billion, four hundred one million, fifty-five thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •