Base | Representation |
---|---|
bin | 1100000000010111000001… |
… | …1101101100000000010101 |
3 | 1201201221100002102112100020 |
4 | 3000011300131230000111 |
5 | 3212233224230044341 |
6 | 44024051025535353 |
7 | 2531456161000203 |
oct | 300056035540025 |
9 | 51657302375306 |
10 | 13200321331221 |
11 | 422a252294892 |
12 | 1592388aa4559 |
13 | 749a287336bb |
14 | 338c82a70073 |
15 | 17d585e30566 |
hex | c017076c015 |
13200321331221 has 8 divisors (see below), whose sum is σ = 17600447624160. Its totient is φ = 8800204629552.
The previous prime is 13200321331217. The next prime is 13200321331243. The reversal of 13200321331221 is 12213312300231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13200321331221 - 22 = 13200321331217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13200321331191 and 13200321331200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13200321331261) 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, 1928790 + ... + 5488248.
It is an arithmetic number, because the mean of its divisors is an integer number (2200055953020).
Almost surely, 213200321331221 is an apocalyptic number.
It is an amenable number.
13200321331221 is a deficient number, since it is larger than the sum of its proper divisors (4400126292939).
13200321331221 is a wasteful number, since it uses less digits than its factorization.
13200321331221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4795635.
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 13200321331221 its reverse (12213312300231), we get a palindrome (25413633631452).
The spelling of 13200321331221 in words is "thirteen trillion, two hundred billion, three hundred twenty-one million, three hundred thirty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •