Base | Representation |
---|---|
bin | 10011110010101000001… |
… | …000110101010000100101 |
3 | 11211000110212102111222121 |
4 | 103302220020311100211 |
5 | 134240320310200000 |
6 | 2520442302425541 |
7 | 200154552650266 |
oct | 23625010652045 |
9 | 4730425374877 |
10 | 1360030553125 |
11 | 484870878272 |
12 | 19b6bb5922b1 |
13 | 9b333c912aa |
14 | 49b7c11296d |
15 | 2559e1b0b1a |
hex | 13ca8235425 |
1360030553125 has 12 divisors (see below), whose sum is σ = 1699929392868. Its totient is φ = 1088024440000.
The previous prime is 1360030553087. The next prime is 1360030553177. The reversal of 1360030553125 is 5213550300631.
It can be written as a sum of positive squares in 6 ways, for example, as 1185204546241 + 174826006884 = 1088671^2 + 418122^2 .
It is not a de Polignac number, because 1360030553125 - 27 = 1360030552997 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 (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 217601764 + ... + 217608013.
It is an arithmetic number, because the mean of its divisors is an integer number (141660782739).
Almost surely, 21360030553125 is an apocalyptic number.
It is an amenable number.
1360030553125 is a deficient number, since it is larger than the sum of its proper divisors (339898839743).
1360030553125 is an frugal number, since it uses more digits than its factorization.
1360030553125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 435209802 (or 435209782 counting only the distinct ones).
The product of its (nonzero) digits is 40500, while the sum is 34.
Adding to 1360030553125 its reverse (5213550300631), we get a palindrome (6573580853756).
The spelling of 1360030553125 in words is "one trillion, three hundred sixty billion, thirty million, five hundred fifty-three thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •