Base | Representation |
---|---|
bin | 10011010110101100100… |
… | …111110100001111010101 |
3 | 11201011001211211001010212 |
4 | 103112230213310033111 |
5 | 133242410444410310 |
6 | 2455002402455205 |
7 | 165043441035302 |
oct | 23265447641725 |
9 | 4634054731125 |
10 | 1330041013205 |
11 | 473081529033 |
12 | 195930064505 |
13 | 98564b1c2b8 |
14 | 4853522c0a9 |
15 | 248e6451205 |
hex | 135ac9f43d5 |
1330041013205 has 4 divisors (see below), whose sum is σ = 1596049215852. Its totient is φ = 1064032810560.
The previous prime is 1330041013199. The next prime is 1330041013241. The reversal of 1330041013205 is 5023101400331.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 140985981361 + 1189055031844 = 375481^2 + 1090438^2 .
It is not a de Polignac number, because 1330041013205 - 224 = 1330024235989 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133004101316 + ... + 133004101325.
It is an arithmetic number, because the mean of its divisors is an integer number (399012303963).
Almost surely, 21330041013205 is an apocalyptic number.
It is an amenable number.
1330041013205 is a deficient number, since it is larger than the sum of its proper divisors (266008202647).
1330041013205 is an equidigital number, since it uses as much as digits as its factorization.
1330041013205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266008202646.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 1330041013205 its reverse (5023101400331), we get a palindrome (6353142413536).
The spelling of 1330041013205 in words is "one trillion, three hundred thirty billion, forty-one million, thirteen thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •