Base | Representation |
---|---|
bin | 10011101110111… |
… | …110110101110001 |
3 | 212001222202122211 |
4 | 103232332311301 |
5 | 1134224124441 |
6 | 52504132121 |
7 | 11130105625 |
oct | 2356766561 |
9 | 761882584 |
10 | 331083121 |
11 | 15a984716 |
12 | 92a67041 |
13 | 53791a95 |
14 | 31d85185 |
15 | 1e0eda81 |
hex | 13bbed71 |
331083121 has 2 divisors, whose sum is σ = 331083122. Its totient is φ = 331083120.
The previous prime is 331083119. The next prime is 331083157. The reversal of 331083121 is 121380133.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 197796096 + 133287025 = 14064^2 + 11545^2 .
It is a cyclic number.
It is not a de Polignac number, because 331083121 - 21 = 331083119 is a prime.
It is a super-2 number, since 2×3310831212 = 219232066022201282, which contains 22 as substring.
Together with 331083119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 331083092 and 331083101.
It is not a weakly prime, because it can be changed into another prime (331083191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165541560 + 165541561.
It is an arithmetic number, because the mean of its divisors is an integer number (165541561).
Almost surely, 2331083121 is an apocalyptic number.
It is an amenable number.
331083121 is a deficient number, since it is larger than the sum of its proper divisors (1).
331083121 is an equidigital number, since it uses as much as digits as its factorization.
331083121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
The square root of 331083121 is about 18195.6896269419. The cubic root of 331083121 is about 691.7975402293.
The spelling of 331083121 in words is "three hundred thirty-one million, eighty-three thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •