Base | Representation |
---|---|
bin | 10011110011110101101… |
… | …011101011110110100001 |
3 | 11211010211112110020222022 |
4 | 103303311223223312201 |
5 | 134301001333112030 |
6 | 2521215335151225 |
7 | 200232031061162 |
oct | 23636553536641 |
9 | 4733745406868 |
10 | 1361331535265 |
11 | 485379186419 |
12 | 19ba03215515 |
13 | 9b4b0681300 |
14 | 49c62c0b769 |
15 | 256284e6de5 |
hex | 13cf5aebda1 |
1361331535265 has 12 divisors (see below), whose sum is σ = 1768925475324. Its totient is φ = 1005290979264.
The previous prime is 1361331535261. The next prime is 1361331535321. The reversal of 1361331535265 is 5625351331631.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 60105386896 + 1301226148369 = 245164^2 + 1140713^2 .
It is not a de Polignac number, because 1361331535265 - 22 = 1361331535261 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1361331535261) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 805520774 + ... + 805522463.
It is an arithmetic number, because the mean of its divisors is an integer number (147410456277).
Almost surely, 21361331535265 is an apocalyptic number.
It is an amenable number.
1361331535265 is a deficient number, since it is larger than the sum of its proper divisors (407593940059).
1361331535265 is a wasteful number, since it uses less digits than its factorization.
1361331535265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1611043268 (or 1611043255 counting only the distinct ones).
The product of its digits is 729000, while the sum is 44.
Adding to 1361331535265 its reverse (5625351331631), we get a palindrome (6986682866896).
The spelling of 1361331535265 in words is "one trillion, three hundred sixty-one billion, three hundred thirty-one million, five hundred thirty-five thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •