Base | Representation |
---|---|
bin | 1100000010101100000011… |
… | …1000100011000101100001 |
3 | 1201212202121000212102222011 |
4 | 3000223000320203011201 |
5 | 3213412141231134041 |
6 | 44054304344512521 |
7 | 2534403413514130 |
oct | 300530070430541 |
9 | 51782530772864 |
10 | 13240325255521 |
11 | 4245210483251 |
12 | 159a09217b741 |
13 | 75073255b220 |
14 | 33ab9997d917 |
15 | 17e627e3ee81 |
hex | c0ac0e23161 |
13240325255521 has 8 divisors (see below), whose sum is σ = 16295784929984. Its totient is φ = 10475861740560.
The previous prime is 13240325255467. The next prime is 13240325255623. The reversal of 13240325255521 is 12555252304231.
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 13240325255521 - 213 = 13240325247329 is a prime.
It is a super-3 number, since 3×132403252555213 (a number of 40 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (13240325259521) 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, 72749039775 + ... + 72749039956.
It is an arithmetic number, because the mean of its divisors is an integer number (2036973116248).
Almost surely, 213240325255521 is an apocalyptic number.
It is an amenable number.
13240325255521 is a deficient number, since it is larger than the sum of its proper divisors (3055459674463).
13240325255521 is a wasteful number, since it uses less digits than its factorization.
13240325255521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 145498079751.
The product of its (nonzero) digits is 360000, while the sum is 40.
Adding to 13240325255521 its reverse (12555252304231), we get a palindrome (25795577559752).
The spelling of 13240325255521 in words is "thirteen trillion, two hundred forty billion, three hundred twenty-five million, two hundred fifty-five thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •