Base | Representation |
---|---|
bin | 11000110110011010… |
… | …01000101100011101 |
3 | 1021102210001210110221 |
4 | 30123031020230131 |
5 | 204310340031310 |
6 | 10043503001341 |
7 | 651416302300 |
oct | 143315105435 |
9 | 37383053427 |
10 | 13341330205 |
11 | 5726918935 |
12 | 2703b99251 |
13 | 1348010938 |
14 | 907c1ab37 |
15 | 5313c6ada |
hex | 31b348b1d |
13341330205 has 24 divisors (see below), whose sum is σ = 19433129472. Its totient is φ = 8750583072.
The previous prime is 13341330181. The next prime is 13341330307. The reversal of 13341330205 is 50203314331.
13341330205 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13341330205 - 219 = 13340805917 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 13341330205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1178157 + ... + 1189426.
It is an arithmetic number, because the mean of its divisors is an integer number (809713728).
Almost surely, 213341330205 is an apocalyptic number.
It is an amenable number.
13341330205 is a deficient number, since it is larger than the sum of its proper divisors (6091799267).
13341330205 is a wasteful number, since it uses less digits than its factorization.
13341330205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2367625 (or 2367618 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 25.
Adding to 13341330205 its reverse (50203314331), we get a palindrome (63544644536).
The spelling of 13341330205 in words is "thirteen billion, three hundred forty-one million, three hundred thirty thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •