Base | Representation |
---|---|
bin | 10011100100111011100… |
… | …111101011011101111101 |
3 | 11202121112000101002100121 |
4 | 103210323213223131331 |
5 | 134020211201133203 |
6 | 2510011144054541 |
7 | 166124260000036 |
oct | 23447347533575 |
9 | 4677460332317 |
10 | 1345325021053 |
11 | 4796049a1382 |
12 | 198896764451 |
13 | 99b2c457020 |
14 | 49185061a8d |
15 | 24edd1660bd |
hex | 1393b9eb77d |
1345325021053 has 8 divisors (see below), whose sum is σ = 1448845391448. Its totient is φ = 1241809483584.
The previous prime is 1345325021017. The next prime is 1345325021077. The reversal of 1345325021053 is 3501205235431.
It can be written as a sum of positive squares in 4 ways, for example, as 8866482244 + 1336458538809 = 94162^2 + 1156053^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1345325021053 - 29 = 1345325020541 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1345325021003) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 619450 + ... + 1753387.
It is an arithmetic number, because the mean of its divisors is an integer number (181105673931).
Almost surely, 21345325021053 is an apocalyptic number.
1345325021053 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
1345325021053 is a deficient number, since it is larger than the sum of its proper divisors (103520370395).
1345325021053 is a wasteful number, since it uses less digits than its factorization.
1345325021053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2416463.
The product of its (nonzero) digits is 54000, while the sum is 34.
The spelling of 1345325021053 in words is "one trillion, three hundred forty-five billion, three hundred twenty-five million, twenty-one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •