Base | Representation |
---|---|
bin | 1100001100101011101001… |
… | …0010110110010001111101 |
3 | 1202111011202021101220121222 |
4 | 3003022322102312101331 |
5 | 3224220300412314323 |
6 | 44305221025403125 |
7 | 2552662123622630 |
oct | 303127222662175 |
9 | 52434667356558 |
10 | 13412013401213 |
11 | 4301003a07249 |
12 | 16074081994a5 |
13 | 763994170c8b |
14 | 3452058d3c17 |
15 | 183d25a9b9c8 |
hex | c32ba4b647d |
13412013401213 has 8 divisors (see below), whose sum is σ = 15328038248832. Its totient is φ = 11495994286896.
The previous prime is 13412013401201. The next prime is 13412013401273. The reversal of 13412013401213 is 31210431021431.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13412013401213 - 28 = 13412013400957 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 (13412013401273) 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 7 ways as a sum of consecutive naturals, for example, 6526331 + ... + 8331687.
It is an arithmetic number, because the mean of its divisors is an integer number (1916004781104).
Almost surely, 213412013401213 is an apocalyptic number.
It is an amenable number.
13412013401213 is a deficient number, since it is larger than the sum of its proper divisors (1916024847619).
13412013401213 is a wasteful number, since it uses less digits than its factorization.
13412013401213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2866651.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 13412013401213 its reverse (31210431021431), we get a palindrome (44622444422644).
The spelling of 13412013401213 in words is "thirteen trillion, four hundred twelve billion, thirteen million, four hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •