Base | Representation |
---|---|
bin | 1100011000001011011000… |
… | …1101100100000000000001 |
3 | 1210012001112101111111102121 |
4 | 3012002312031210000001 |
5 | 3240434240412333434 |
6 | 44540042452044241 |
7 | 2603153300134363 |
oct | 306026615440001 |
9 | 53161471444377 |
10 | 13609513402369 |
11 | 43778425752a5 |
12 | 1639746603681 |
13 | 7794aa5613a1 |
14 | 3509bd964d33 |
15 | 1890347e57b4 |
hex | c60b6364001 |
13609513402369 has 8 divisors (see below), whose sum is σ = 14133864668000. Its totient is φ = 13094609907456.
The previous prime is 13609513402367. The next prime is 13609513402403. The reversal of 13609513402369 is 96320431590631.
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 13609513402369 - 21 = 13609513402367 is a prime.
It is a super-2 number, since 2×136095134023692 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13609513402367) 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, 2361939744 + ... + 2361945505.
It is an arithmetic number, because the mean of its divisors is an integer number (1766733083500).
Almost surely, 213609513402369 is an apocalyptic number.
It is an amenable number.
13609513402369 is a deficient number, since it is larger than the sum of its proper divisors (524351265631).
13609513402369 is an equidigital number, since it uses as much as digits as its factorization.
13609513402369 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4723885359.
The product of its (nonzero) digits is 3149280, while the sum is 52.
The spelling of 13609513402369 in words is "thirteen trillion, six hundred nine billion, five hundred thirteen million, four hundred two thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.636 sec. • engine limits •