Base | Representation |
---|---|
bin | 10011111100100010000… |
… | …001101010111001111101 |
3 | 11212000221000211021100111 |
4 | 103330202001222321331 |
5 | 134424110322240103 |
6 | 2525401445030021 |
7 | 201012236633161 |
oct | 23744201527175 |
9 | 4760830737314 |
10 | 1370665430653 |
11 | 4893289a2152 |
12 | 1a17890b5311 |
13 | 9c33a36942c |
14 | 4a4aa6daca1 |
15 | 259c2b7a86d |
hex | 13f2206ae7d |
1370665430653 has 4 divisors (see below), whose sum is σ = 1370667820348. Its totient is φ = 1370663040960.
The previous prime is 1370665430627. The next prime is 1370665430663. The reversal of 1370665430653 is 3560345660731.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 218310414169 + 1152355016484 = 467237^2 + 1073478^2 .
It is a cyclic number.
It is not a de Polignac number, because 1370665430653 - 229 = 1370128559741 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1370665430597 and 1370665430606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1370665430623) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 239323 + ... + 1672903.
It is an arithmetic number, because the mean of its divisors is an integer number (342666955087).
Almost surely, 21370665430653 is an apocalyptic number.
It is an amenable number.
1370665430653 is a deficient number, since it is larger than the sum of its proper divisors (2389695).
1370665430653 is an equidigital number, since it uses as much as digits as its factorization.
1370665430653 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2389694.
The product of its (nonzero) digits is 4082400, while the sum is 49.
The spelling of 1370665430653 in words is "one trillion, three hundred seventy billion, six hundred sixty-five million, four hundred thirty thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •