Base | Representation |
---|---|
bin | 10011110001001… |
… | …111110100001101 |
3 | 212010002221020011 |
4 | 103301033310031 |
5 | 1134402130231 |
6 | 52524553221 |
7 | 11135131111 |
oct | 2361176415 |
9 | 763087204 |
10 | 331676941 |
11 | 16024a882 |
12 | 930b2811 |
13 | 5393c15b |
14 | 3209b741 |
15 | 1e1b99b1 |
hex | 13c4fd0d |
331676941 has 2 divisors, whose sum is σ = 331676942. Its totient is φ = 331676940.
The previous prime is 331676909. The next prime is 331676957. The reversal of 331676941 is 149676133.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 192932100 + 138744841 = 13890^2 + 11779^2 .
It is an emirp because it is prime and its reverse (149676133) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 331676941 - 25 = 331676909 is a prime.
It is a super-2 number, since 2×3316769412 = 220019186382234962, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 331676894 and 331676903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (331676971) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165838470 + 165838471.
It is an arithmetic number, because the mean of its divisors is an integer number (165838471).
Almost surely, 2331676941 is an apocalyptic number.
It is an amenable number.
331676941 is a deficient number, since it is larger than the sum of its proper divisors (1).
331676941 is an equidigital number, since it uses as much as digits as its factorization.
331676941 is an evil number, because the sum of its binary digits is even.
The product of its digits is 81648, while the sum is 40.
The square root of 331676941 is about 18211.9999176367. Note that the first 4 decimals coincide. The cubic root of 331676941 is about 692.2108884518.
The spelling of 331676941 in words is "three hundred thirty-one million, six hundred seventy-six thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •