Base | Representation |
---|---|
bin | 1100000001001111101001… |
… | …1000100000100100100101 |
3 | 1201210101120022122120120002 |
4 | 3000103322120200210211 |
5 | 3213010341123200430 |
6 | 44035043124551045 |
7 | 2532534623445656 |
oct | 300237230404445 |
9 | 51711508576502 |
10 | 13215520131365 |
11 | 423574164a342 |
12 | 159530ab52485 |
13 | 74b2ab506876 |
14 | 3398c544352d |
15 | 17db75413845 |
hex | c04fa620925 |
13215520131365 has 8 divisors (see below), whose sum is σ = 15858643721760. Its totient is φ = 10572403062352.
The previous prime is 13215520131361. The next prime is 13215520131367. The reversal of 13215520131365 is 56313102551231.
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 13215520131365 - 22 = 13215520131361 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13215520131361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6664862 + ... + 8417328.
It is an arithmetic number, because the mean of its divisors is an integer number (1982330465220).
Almost surely, 213215520131365 is an apocalyptic number.
It is an amenable number.
13215520131365 is a deficient number, since it is larger than the sum of its proper divisors (2643123590395).
13215520131365 is a wasteful number, since it uses less digits than its factorization.
13215520131365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3260691.
The product of its (nonzero) digits is 81000, while the sum is 38.
Adding to 13215520131365 its reverse (56313102551231), we get a palindrome (69528622682596).
The spelling of 13215520131365 in words is "thirteen trillion, two hundred fifteen billion, five hundred twenty million, one hundred thirty-one thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •