Base | Representation |
---|---|
bin | 10011110011110000110… |
… | …100110000000001011101 |
3 | 11211010121212002010200112 |
4 | 103303300310300001131 |
5 | 134300320001304230 |
6 | 2521203304135405 |
7 | 200230021206443 |
oct | 23636064600135 |
9 | 4733555063615 |
10 | 1361250025565 |
11 | 485337173a31 |
12 | 19b99ba67565 |
13 | 9b499812a11 |
14 | 49c56070b93 |
15 | 25621295d95 |
hex | 13cf0d3005d |
1361250025565 has 8 divisors (see below), whose sum is σ = 1633661936088. Its totient is φ = 1088892083520.
The previous prime is 1361250025549. The next prime is 1361250025601. The reversal of 1361250025565 is 5655200521631.
It can be written as a sum of positive squares in 4 ways, for example, as 490815138724 + 870434886841 = 700582^2 + 932971^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1361250025565 - 24 = 1361250025549 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13436606 + ... + 13537535.
It is an arithmetic number, because the mean of its divisors is an integer number (204207742011).
Almost surely, 21361250025565 is an apocalyptic number.
It is an amenable number.
1361250025565 is a deficient number, since it is larger than the sum of its proper divisors (272411910523).
1361250025565 is a wasteful number, since it uses less digits than its factorization.
1361250025565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26984239.
The product of its (nonzero) digits is 270000, while the sum is 41.
The spelling of 1361250025565 in words is "one trillion, three hundred sixty-one billion, two hundred fifty million, twenty-five thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •