Base | Representation |
---|---|
bin | 1100010000110000100101… |
… | …1111010100011111101101 |
3 | 1202201212120001100102210102 |
4 | 3010030021133110133231 |
5 | 3231342230224010001 |
6 | 44401323520320445 |
7 | 2561022024216521 |
oct | 304141137243755 |
9 | 52655501312712 |
10 | 13482061547501 |
11 | 432878a2a3338 |
12 | 1618ab7173125 |
13 | 76a478575051 |
14 | 34876ca7dd81 |
15 | 185a7551ce6b |
hex | c43097d47ed |
13482061547501 has 4 divisors (see below), whose sum is σ = 13489726166400. Its totient is φ = 13474396928604.
The previous prime is 13482061547489. The next prime is 13482061547519. The reversal of 13482061547501 is 10574516028431.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13482061547501 - 222 = 13482057353197 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 (13482061547531) 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 3 ways as a sum of consecutive naturals, for example, 3832306811 + ... + 3832310328.
It is an arithmetic number, because the mean of its divisors is an integer number (3372431541600).
Almost surely, 213482061547501 is an apocalyptic number.
It is an amenable number.
13482061547501 is a deficient number, since it is larger than the sum of its proper divisors (7664618899).
13482061547501 is an equidigital number, since it uses as much as digits as its factorization.
13482061547501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7664618898.
The product of its (nonzero) digits is 806400, while the sum is 47.
The spelling of 13482061547501 in words is "thirteen trillion, four hundred eighty-two billion, sixty-one million, five hundred forty-seven thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •