Base | Representation |
---|---|
bin | 10011110000101… |
… | …000000100010011 |
3 | 212002210122220011 |
4 | 103300220010103 |
5 | 1134331423011 |
6 | 52521255351 |
7 | 11133552334 |
oct | 2360500423 |
9 | 762718804 |
10 | 331514131 |
11 | 160149523 |
12 | 93034557 |
13 | 538b3010 |
14 | 3205828b |
15 | 1e186621 |
hex | 13c28113 |
331514131 has 4 divisors (see below), whose sum is σ = 357015232. Its totient is φ = 306013032.
The previous prime is 331514119. The next prime is 331514137. The reversal of 331514131 is 131415133.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131415133 = 5623 ⋅23371.
It is not a de Polignac number, because 331514131 - 27 = 331514003 is a prime.
It is a super-2 number, since 2×3315141312 = 219803238105370322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (331514137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12750531 + ... + 12750556.
It is an arithmetic number, because the mean of its divisors is an integer number (89253808).
Almost surely, 2331514131 is an apocalyptic number.
331514131 is a deficient number, since it is larger than the sum of its proper divisors (25501101).
331514131 is a wasteful number, since it uses less digits than its factorization.
331514131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25501100.
The product of its digits is 540, while the sum is 22.
The square root of 331514131 is about 18207.5295139126. The cubic root of 331514131 is about 692.0976082425.
Adding to 331514131 its reverse (131415133), we get a palindrome (462929264).
The spelling of 331514131 in words is "three hundred thirty-one million, five hundred fourteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •