Base | Representation |
---|---|
bin | 1100000000101010000110… |
… | …1110101110011111101011 |
3 | 1201202102120000110120121112 |
4 | 3000022201232232133223 |
5 | 3212324221332124442 |
6 | 44030255141500535 |
7 | 2532030120116162 |
oct | 300124156563753 |
9 | 51672500416545 |
10 | 13205442848747 |
11 | 423144024a7a6 |
12 | 159337811174b |
13 | 74a3637cab46 |
14 | 33920ad243d9 |
15 | 17d78588c082 |
hex | c02a1bae7eb |
13205442848747 has 8 divisors (see below), whose sum is σ = 13484987015280. Its totient is φ = 12927756119040.
The previous prime is 13205442848671. The next prime is 13205442848831. The reversal of 13205442848747 is 74784824450231.
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 13205442848747 - 232 = 13201147881451 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (59).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13205442848947) 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, 464344838 + ... + 464373275.
It is an arithmetic number, because the mean of its divisors is an integer number (1685623376910).
Almost surely, 213205442848747 is an apocalyptic number.
13205442848747 is a deficient number, since it is larger than the sum of its proper divisors (279544166533).
13205442848747 is an equidigital number, since it uses as much as digits as its factorization.
13205442848747 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 928718413.
The product of its (nonzero) digits is 48168960, while the sum is 59.
The spelling of 13205442848747 in words is "thirteen trillion, two hundred five billion, four hundred forty-two million, eight hundred forty-eight thousand, seven hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •