Base | Representation |
---|---|
bin | 1100000110001110000111… |
… | …1110100001010001001101 |
3 | 1202002120020020221102221022 |
4 | 3001203201332201101031 |
5 | 3220410432030324323 |
6 | 44142222153443525 |
7 | 2541652266442121 |
oct | 301434176412115 |
9 | 52076206842838 |
10 | 13301010011213 |
11 | 4268a21438401 |
12 | 15a99a94105a5 |
13 | 756383b1aba2 |
14 | 33dab535d581 |
15 | 180eca8534c8 |
hex | c18e1fa144d |
13301010011213 has 8 divisors (see below), whose sum is σ = 13320049195200. Its totient is φ = 13281973640928.
The previous prime is 13301010011203. The next prime is 13301010011239. The reversal of 13301010011213 is 31211001010331.
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 13301010011213 - 216 = 13301009945677 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13301010011191 and 13301010011200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13301010011203) 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, 8850545 + ... + 10243737.
It is an arithmetic number, because the mean of its divisors is an integer number (1665006149400).
Almost surely, 213301010011213 is an apocalyptic number.
It is an amenable number.
13301010011213 is a deficient number, since it is larger than the sum of its proper divisors (19039183987).
13301010011213 is a wasteful number, since it uses less digits than its factorization.
13301010011213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1406851.
The product of its (nonzero) digits is 54, while the sum is 17.
Adding to 13301010011213 its reverse (31211001010331), we get a palindrome (44512011021544).
The spelling of 13301010011213 in words is "thirteen trillion, three hundred one billion, ten million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •