Base | Representation |
---|---|
bin | 1100000000011010110101… |
… | …1100110110101101101001 |
3 | 1201202000222101202001202020 |
4 | 3000012231130312231221 |
5 | 3212242323144214423 |
6 | 44024340340255053 |
7 | 2531523423663015 |
oct | 300065534665551 |
9 | 51660871661666 |
10 | 13201344523113 |
11 | 422a72790901a |
12 | 15926136a1489 |
13 | 749b5c700aa6 |
14 | 338d3c8d7545 |
15 | 17d5e5b934e3 |
hex | c01ad736b69 |
13201344523113 has 8 divisors (see below), whose sum is σ = 17849705270976. Its totient is φ = 8676940062000.
The previous prime is 13201344523079. The next prime is 13201344523231. The reversal of 13201344523113 is 31132544310231.
13201344523113 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13201344523113 - 28 = 13201344522857 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13201344523513) 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, 30989071438 + ... + 30989071863.
It is an arithmetic number, because the mean of its divisors is an integer number (2231213158872).
Almost surely, 213201344523113 is an apocalyptic number.
It is an amenable number.
13201344523113 is a deficient number, since it is larger than the sum of its proper divisors (4648360747863).
13201344523113 is an equidigital number, since it uses as much as digits as its factorization.
13201344523113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61978143375.
The product of its (nonzero) digits is 25920, while the sum is 33.
Adding to 13201344523113 its reverse (31132544310231), we get a palindrome (44333888833344).
The spelling of 13201344523113 in words is "thirteen trillion, two hundred one billion, three hundred forty-four million, five hundred twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •