Base | Representation |
---|---|
bin | 100111000011010… |
… | …0000011001010101 |
3 | 10101022121120122200 |
4 | 1032012200121111 |
5 | 10140421002110 |
6 | 334004515113 |
7 | 44320415301 |
oct | 11606403125 |
9 | 3338546580 |
10 | 1310328405 |
11 | 612712141 |
12 | 3069aba99 |
13 | 17b613169 |
14 | c604cd01 |
15 | 7a0806c0 |
hex | 4e1a0655 |
1310328405 has 24 divisors (see below), whose sum is σ = 2293294848. Its totient is φ = 692054496.
The previous prime is 1310328403. The next prime is 1310328427. The reversal of 1310328405 is 5048230131.
It is a happy number.
It is not a de Polignac number, because 1310328405 - 21 = 1310328403 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310328403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 136717 + ... + 145986.
It is an arithmetic number, because the mean of its divisors is an integer number (95553952).
Almost surely, 21310328405 is an apocalyptic number.
1310328405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1310328405 is a deficient number, since it is larger than the sum of its proper divisors (982966443).
1310328405 is a wasteful number, since it uses less digits than its factorization.
1310328405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282817 (or 282814 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 1310328405 is about 36198.4585997802. The cubic root of 1310328405 is about 1094.2756077078.
Adding to 1310328405 its reverse (5048230131), we get a palindrome (6358558536).
The spelling of 1310328405 in words is "one billion, three hundred ten million, three hundred twenty-eight thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •