Base | Representation |
---|---|
bin | 10011101111110… |
… | …110010000111001 |
3 | 212002102022001211 |
4 | 103233312100321 |
5 | 1134303411022 |
6 | 52513043121 |
7 | 11132042524 |
oct | 2357662071 |
9 | 762368054 |
10 | 331310137 |
11 | 16001a234 |
12 | 92b564a1 |
13 | 53841202 |
14 | 32003bbb |
15 | 1e145e77 |
hex | 13bf6439 |
331310137 has 4 divisors (see below), whose sum is σ = 331533540. Its totient is φ = 331086736.
The previous prime is 331310117. The next prime is 331310143. The reversal of 331310137 is 731013133.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 731013133 = 26321 ⋅27773.
It can be written as a sum of positive squares in 2 ways, for example, as 270142096 + 61168041 = 16436^2 + 7821^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-331310137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (331310117) 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 3 ways as a sum of consecutive naturals, for example, 109462 + ... + 112447.
It is an arithmetic number, because the mean of its divisors is an integer number (82883385).
Almost surely, 2331310137 is an apocalyptic number.
It is an amenable number.
331310137 is a deficient number, since it is larger than the sum of its proper divisors (223403).
331310137 is a wasteful number, since it uses less digits than its factorization.
331310137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223402.
The product of its (nonzero) digits is 567, while the sum is 22.
The square root of 331310137 is about 18201.9267386725. The cubic root of 331310137 is about 691.9556206016.
The spelling of 331310137 in words is "three hundred thirty-one million, three hundred ten thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •