Base | Representation |
---|---|
bin | 100111101011010… |
… | …0110101010100101 |
3 | 10102210010100101202 |
4 | 1033112212222211 |
5 | 10211304404410 |
6 | 340034532245 |
7 | 44664036521 |
oct | 11726465245 |
9 | 3383110352 |
10 | 1331325605 |
11 | 6235536a5 |
12 | 311a37085 |
13 | 182a8543c |
14 | c8b56d81 |
15 | 7bd2bca5 |
hex | 4f5a6aa5 |
1331325605 has 8 divisors (see below), whose sum is σ = 1601617272. Its totient is φ = 1062376128.
The previous prime is 1331325571. The next prime is 1331325613. The reversal of 1331325605 is 5065231331.
It can be written as a sum of positive squares in 4 ways, for example, as 199204996 + 1132120609 = 14114^2 + 33647^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1331325605 - 210 = 1331324581 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 (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333362 + ... + 337331.
It is an arithmetic number, because the mean of its divisors is an integer number (200202159).
Almost surely, 21331325605 is an apocalyptic number.
It is an amenable number.
1331325605 is a deficient number, since it is larger than the sum of its proper divisors (270291667).
1331325605 is an equidigital number, since it uses as much as digits as its factorization.
1331325605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 671095.
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 1331325605 is about 36487.3348574543. The cubic root of 1331325605 is about 1100.0896910337.
Adding to 1331325605 its reverse (5065231331), we get a palindrome (6396556936).
The spelling of 1331325605 in words is "one billion, three hundred thirty-one million, three hundred twenty-five thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •