Base | Representation |
---|---|
bin | 1100000001001011100001… |
… | …0011000101111100001111 |
3 | 1201210021201001101222001112 |
4 | 3000102320103011330033 |
5 | 3213001103310242221 |
6 | 44034341121202235 |
7 | 2532465301511441 |
oct | 300227023057417 |
9 | 51707631358045 |
10 | 13214411415311 |
11 | 4235222821587 |
12 | 159505b79037b |
13 | 74b1628c3872 |
14 | 33981c0b6491 |
15 | 17db0ce0a15b |
hex | c04b84c5f0f |
13214411415311 has 8 divisors (see below), whose sum is σ = 13245258342960. Its totient is φ = 13183566003072.
The previous prime is 13214411415259. The next prime is 13214411415341. The reversal of 13214411415311 is 11351411441231.
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 13214411415311 - 226 = 13214344306447 is a prime.
It is a super-2 number, since 2×132144114153112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13214411415341) 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, 18135716 + ... + 18850278.
It is an arithmetic number, because the mean of its divisors is an integer number (1655657292870).
Almost surely, 213214411415311 is an apocalyptic number.
13214411415311 is a deficient number, since it is larger than the sum of its proper divisors (30846927649).
13214411415311 is an equidigital number, since it uses as much as digits as its factorization.
13214411415311 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 757705.
The product of its digits is 5760, while the sum is 32.
Adding to 13214411415311 its reverse (11351411441231), we get a palindrome (24565822856542).
The spelling of 13214411415311 in words is "thirteen trillion, two hundred fourteen billion, four hundred eleven million, four hundred fifteen thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •