Base | Representation |
---|---|
bin | 100111000011001… |
… | …1110011011001011 |
3 | 10101022121011120122 |
4 | 1032012132123023 |
5 | 10140420222311 |
6 | 334004413455 |
7 | 44320352615 |
oct | 11606363313 |
9 | 3338534518 |
10 | 1310320331 |
11 | 612707071 |
12 | 3069a728b |
13 | 17b60c598 |
14 | c6049db5 |
15 | 7a07d0db |
hex | 4e19e6cb |
1310320331 has 8 divisors (see below), whose sum is σ = 1346194080. Its totient is φ = 1274470848.
The previous prime is 1310320261. The next prime is 1310320337. The reversal of 1310320331 is 1330230131.
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 1310320331 - 214 = 1310303947 is a prime.
It is a super-2 number, since 2×13103203312 = 3433878739663899122, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1310320337) by changing a digit.
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, 180290 + ... + 187416.
It is an arithmetic number, because the mean of its divisors is an integer number (168274260).
Almost surely, 21310320331 is an apocalyptic number.
1310320331 is a deficient number, since it is larger than the sum of its proper divisors (35873749).
1310320331 is an equidigital number, since it uses as much as digits as its factorization.
1310320331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12133.
The product of its (nonzero) digits is 162, while the sum is 17.
The square root of 1310320331 is about 36198.3470755227. The cubic root of 1310320331 is about 1094.2733601289.
Adding to 1310320331 its reverse (1330230131), we get a palindrome (2640550462).
The spelling of 1310320331 in words is "one billion, three hundred ten million, three hundred twenty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •