Base | Representation |
---|---|
bin | 1100000010000111000111… |
… | …1101110011111000111101 |
3 | 1201211211000010000100020122 |
4 | 3000201301331303320331 |
5 | 3213231340243103123 |
6 | 44045544514224325 |
7 | 2533602632342666 |
oct | 300416175637075 |
9 | 51754003010218 |
10 | 13230411300413 |
11 | 4240a9329901a |
12 | 1598185b850a5 |
13 | 74c8126396b8 |
14 | 33a4d901836d |
15 | 17e2478cbbc8 |
hex | c0871f73e3d |
13230411300413 has 4 divisors (see below), whose sum is σ = 13805646574368. Its totient is φ = 12655176026460.
The previous prime is 13230411300409. The next prime is 13230411300451. The reversal of 13230411300413 is 31400311403231.
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 13230411300413 - 22 = 13230411300409 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 (13230411300313) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 287617636943 + ... + 287617636988.
It is an arithmetic number, because the mean of its divisors is an integer number (3451411643592).
Almost surely, 213230411300413 is an apocalyptic number.
It is an amenable number.
13230411300413 is a deficient number, since it is larger than the sum of its proper divisors (575235273955).
13230411300413 is an equidigital number, since it uses as much as digits as its factorization.
13230411300413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 575235273954.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 13230411300413 its reverse (31400311403231), we get a palindrome (44630722703644).
The spelling of 13230411300413 in words is "thirteen trillion, two hundred thirty billion, four hundred eleven million, three hundred thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •