Base | Representation |
---|---|
bin | 1100010010010001100001… |
… | …1110011111111010100011 |
3 | 1202211100201111220201122012 |
4 | 3010210120132133322203 |
5 | 3232304023143403042 |
6 | 44421305542103135 |
7 | 2562632612162414 |
oct | 304443036377243 |
9 | 52740644821565 |
10 | 13508082794147 |
11 | 4338822645057 |
12 | 1621b5971aaab |
13 | 76ca64547406 |
14 | 349b1a90580b |
15 | 186599bbbe82 |
hex | c491879fea3 |
13508082794147 has 8 divisors (see below), whose sum is σ = 14056499244480. Its totient is φ = 12970315207080.
The previous prime is 13508082794051. The next prime is 13508082794183. The reversal of 13508082794147 is 74149728080531.
It is a happy number.
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 13508082794147 - 218 = 13508082532003 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 (13508082704147) 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, 2662213229 + ... + 2662218302.
It is an arithmetic number, because the mean of its divisors is an integer number (1757062405560).
Almost surely, 213508082794147 is an apocalyptic number.
13508082794147 is a deficient number, since it is larger than the sum of its proper divisors (548416450333).
13508082794147 is an equidigital number, since it uses as much as digits as its factorization.
13508082794147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5324431633.
The product of its (nonzero) digits is 13547520, while the sum is 59.
The spelling of 13508082794147 in words is "thirteen trillion, five hundred eight billion, eighty-two million, seven hundred ninety-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •