Base | Representation |
---|---|
bin | 1100001100001111101011… |
… | …0011001001100110110101 |
3 | 1202110110101001021222002002 |
4 | 3003003322303021212311 |
5 | 3224104411423114323 |
6 | 44301540033025045 |
7 | 2552305101203561 |
oct | 303037263114665 |
9 | 52413331258062 |
10 | 13404505676213 |
11 | 42a8900aaa343 |
12 | 1605a719b5185 |
13 | 763068909a52 |
14 | 344ad27706a1 |
15 | 183a368e0828 |
hex | c30facc99b5 |
13404505676213 has 4 divisors (see below), whose sum is σ = 13404893090688. Its totient is φ = 13404118261740.
The previous prime is 13404505676189. The next prime is 13404505676251. The reversal of 13404505676213 is 31267650540431.
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 13404505676213 - 210 = 13404505675189 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 (13404505673213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 193655333 + ... + 193724538.
It is an arithmetic number, because the mean of its divisors is an integer number (3351223272672).
Almost surely, 213404505676213 is an apocalyptic number.
It is an amenable number.
13404505676213 is a deficient number, since it is larger than the sum of its proper divisors (387414475).
13404505676213 is an equidigital number, since it uses as much as digits as its factorization.
13404505676213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 387414474.
The product of its (nonzero) digits is 1814400, while the sum is 47.
The spelling of 13404505676213 in words is "thirteen trillion, four hundred four billion, five hundred five million, six hundred seventy-six thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •