Base | Representation |
---|---|
bin | 110101000010101011001… |
… | …100101100110110111101 |
3 | 110220110101122000211101222 |
4 | 311002223030230312331 |
5 | 434204432123003123 |
6 | 11430254132243125 |
7 | 524225416023113 |
oct | 65025314546675 |
9 | 13813348024358 |
10 | 3645004500413 |
11 | 1185924019571 |
12 | 4aa5147704a5 |
13 | 2059512b5ac3 |
14 | c85c225bab3 |
15 | 64c355dd6c8 |
hex | 350ab32cdbd |
3645004500413 has 8 divisors (see below), whose sum is σ = 3839145765600. Its totient is φ = 3451093127568.
The previous prime is 3645004500373. The next prime is 3645004500419. The reversal of 3645004500413 is 3140054005463.
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 3645004500413 - 236 = 3576285023677 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 (3645004500419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 57440531 + ... + 57503952.
It is an arithmetic number, because the mean of its divisors is an integer number (479893220700).
Almost surely, 23645004500413 is an apocalyptic number.
It is an amenable number.
3645004500413 is a deficient number, since it is larger than the sum of its proper divisors (194141265187).
3645004500413 is a wasteful number, since it uses less digits than its factorization.
3645004500413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 114946171.
The product of its (nonzero) digits is 86400, while the sum is 35.
Adding to 3645004500413 its reverse (3140054005463), we get a palindrome (6785058505876).
The spelling of 3645004500413 in words is "three trillion, six hundred forty-five billion, four million, five hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •