Base | Representation |
---|---|
bin | 10011100000010100100… |
… | …111111001101011000101 |
3 | 11202010202002112122010022 |
4 | 103200110213321223011 |
5 | 133430042201104032 |
6 | 2503432105104525 |
7 | 165560522214455 |
oct | 23402447715305 |
9 | 4663662478108 |
10 | 1340375800517 |
11 | 4774a5217776 |
12 | 197935188145 |
13 | 99520c97570 |
14 | 48c35a1bd65 |
15 | 24ced8e0512 |
hex | 138149f9ac5 |
1340375800517 has 32 divisors (see below), whose sum is σ = 1470321266400. Its totient is φ = 1214481235968.
The previous prime is 1340375800469. The next prime is 1340375800529. The reversal of 1340375800517 is 7150085730431.
It is a Cunningham number, because it is equal to 11577462+1.
It can be written as a sum of positive squares in 16 ways, for example, as 947490038881 + 392885761636 = 973391^2 + 626806^2 .
It is a de Polignac number, because none of the positive numbers 2k-1340375800517 is a prime.
It is a super-2 number, since 2×13403758005172 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1340375800217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 255940823 + ... + 255946059.
It is an arithmetic number, because the mean of its divisors is an integer number (45947539575).
Almost surely, 21340375800517 is an apocalyptic number.
It is an amenable number.
1340375800517 is a deficient number, since it is larger than the sum of its proper divisors (129945465883).
1340375800517 is a wasteful number, since it uses less digits than its factorization.
1340375800517 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6905.
The product of its (nonzero) digits is 352800, while the sum is 44.
The spelling of 1340375800517 in words is "one trillion, three hundred forty billion, three hundred seventy-five million, eight hundred thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •