Base | Representation |
---|---|
bin | 1100000110001110111010… |
… | …0000110101000111101011 |
3 | 1202002120202220200211211111 |
4 | 3001203232200311013223 |
5 | 3220411344401111021 |
6 | 44142255105411151 |
7 | 2541660432233233 |
oct | 301435640650753 |
9 | 52076686624744 |
10 | 13301220332011 |
11 | 426901a12a547 |
12 | 15a9a47939ab7 |
13 | 7563b8579a71 |
14 | 33dad526acc3 |
15 | 180ede04a8e1 |
hex | c18ee8351eb |
13301220332011 has 4 divisors (see below), whose sum is σ = 13301251915672. Its totient is φ = 13301188748352.
The previous prime is 13301220332009. The next prime is 13301220332041. The reversal of 13301220332011 is 11023302210331.
13301220332011 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13301220332011 - 21 = 13301220332009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13301220332041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 15151461 + ... + 16005286.
It is an arithmetic number, because the mean of its divisors is an integer number (3325312978918).
Almost surely, 213301220332011 is an apocalyptic number.
13301220332011 is a deficient number, since it is larger than the sum of its proper divisors (31583661).
13301220332011 is an equidigital number, since it uses as much as digits as its factorization.
13301220332011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31583660.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13301220332011 its reverse (11023302210331), we get a palindrome (24324522542342).
The spelling of 13301220332011 in words is "thirteen trillion, three hundred one billion, two hundred twenty million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •