Base | Representation |
---|---|
bin | 10011101011011101110… |
… | …001101011110001000000 |
3 | 11210021121221021100200221 |
4 | 103223131301223301000 |
5 | 134124043133120000 |
6 | 2513131234352424 |
7 | 166463154520531 |
oct | 23533561536100 |
9 | 4707557240627 |
10 | 1352340520000 |
11 | 481584a71598 |
12 | 19a11412b714 |
13 | 9a6a9a28732 |
14 | 4964ca94688 |
15 | 2529dee261a |
hex | 13addc6bc40 |
1352340520000 has 70 divisors (see below), whose sum is σ = 3353365078118. Its totient is φ = 540936192000.
The previous prime is 1352340519983. The next prime is 1352340520009. The reversal of 1352340520000 is 250432531.
It can be written as a sum of positive squares in 5 ways, for example, as 279392587776 + 1072947932224 = 528576^2 + 1035832^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1352340520009) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 16864257 + ... + 16944256.
Almost surely, 21352340520000 is an apocalyptic number.
1352340520000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1352340520000 is an abundant number, since it is smaller than the sum of its proper divisors (2001024558118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1352340520000 is an frugal number, since it uses more digits than its factorization.
1352340520000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33808545 (or 33808520 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
Adding to 1352340520000 its reverse (250432531), we get a palindrome (1352590952531).
The spelling of 1352340520000 in words is "one trillion, three hundred fifty-two billion, three hundred forty million, five hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •