Base | Representation |
---|---|
bin | 110100101011011110111… |
… | …110010100011110111101 |
3 | 110211002010020002220210001 |
4 | 310223132332110132331 |
5 | 433302432423421023 |
6 | 11411015202114301 |
7 | 522354351460504 |
oct | 64533676243675 |
9 | 13732106086701 |
10 | 3620103342013 |
11 | 1176305a62714 |
12 | 4a572534b991 |
13 | 2034b33a8a52 |
14 | c72dd08383b |
15 | 642794426ad |
hex | 34adef947bd |
3620103342013 has 8 divisors (see below), whose sum is σ = 3637704791160. Its totient is φ = 3602523217920.
The previous prime is 3620103341989. The next prime is 3620103342019. The reversal of 3620103342013 is 3102433010263.
It can be written as a sum of positive squares in 4 ways, for example, as 828604216729 + 2791499125284 = 910277^2 + 1670778^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-3620103342013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3620103342019) 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, 4990870 + ... + 5670007.
It is an arithmetic number, because the mean of its divisors is an integer number (454713098895).
Almost surely, 23620103342013 is an apocalyptic number.
It is an amenable number.
3620103342013 is a deficient number, since it is larger than the sum of its proper divisors (17601449147).
3620103342013 is a wasteful number, since it uses less digits than its factorization.
3620103342013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10662527.
The product of its (nonzero) digits is 7776, while the sum is 28.
Adding to 3620103342013 its reverse (3102433010263), we get a palindrome (6722536352276).
The spelling of 3620103342013 in words is "three trillion, six hundred twenty billion, one hundred three million, three hundred forty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •