Base | Representation |
---|---|
bin | 1100000000011010001000… |
… | …0110011101011110100101 |
3 | 1201202000111010102201202001 |
4 | 3000012202012131132211 |
5 | 3212241430422300310 |
6 | 44024305415045301 |
7 | 2531515622305645 |
oct | 300064206353645 |
9 | 51660433381661 |
10 | 13201154103205 |
11 | 422a63a3797a2 |
12 | 159257b970831 |
13 | 749b2c11c1a3 |
14 | 338d214ca525 |
15 | 17d5d40cc93a |
hex | c01a219d7a5 |
13201154103205 has 8 divisors (see below), whose sum is σ = 15904498012704. Its totient is φ = 10518847890000.
The previous prime is 13201154103187. The next prime is 13201154103209. The reversal of 13201154103205 is 50230145110231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13201154103205 - 229 = 13200617232293 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 (13201154103209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5259422691 + ... + 5259425200.
It is an arithmetic number, because the mean of its divisors is an integer number (1988062251588).
Almost surely, 213201154103205 is an apocalyptic number.
It is an amenable number.
13201154103205 is a deficient number, since it is larger than the sum of its proper divisors (2703343909499).
13201154103205 is a wasteful number, since it uses less digits than its factorization.
13201154103205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10518848147.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 13201154103205 its reverse (50230145110231), we get a palindrome (63431299213436).
The spelling of 13201154103205 in words is "thirteen trillion, two hundred one billion, one hundred fifty-four million, one hundred three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •