Base | Representation |
---|---|
bin | 100101100010110100100000… |
… | …0001100010000010110100101 |
3 | 1121022021202000221001111102001 |
4 | 1023011221000030100112211 |
5 | 321241132244230001343 |
6 | 3130210401141445301 |
7 | 126363063423241405 |
oct | 11305510014202645 |
9 | 1538252027044361 |
10 | 330241112343973 |
11 | 96252518606256 |
12 | 31056b34410831 |
13 | 112367ac4c8b8c |
14 | 5b79a800a4805 |
15 | 282a4e106744d |
hex | 12c5a403105a5 |
330241112343973 has 2 divisors, whose sum is σ = 330241112343974. Its totient is φ = 330241112343972.
The previous prime is 330241112343953. The next prime is 330241112344043. The reversal of 330241112343973 is 379343211142033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 177077766001249 + 153163346342724 = 13307057^2 + 12375918^2 .
It is a cyclic number.
It is not a de Polignac number, because 330241112343973 - 241 = 328042089088421 is a prime.
It is a super-3 number, since 3×3302411123439733 (a number of 45 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330241112343953) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165120556171986 + 165120556171987.
It is an arithmetic number, because the mean of its divisors is an integer number (165120556171987).
Almost surely, 2330241112343973 is an apocalyptic number.
It is an amenable number.
330241112343973 is a deficient number, since it is larger than the sum of its proper divisors (1).
330241112343973 is an equidigital number, since it uses as much as digits as its factorization.
330241112343973 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 979776, while the sum is 46.
The spelling of 330241112343973 in words is "three hundred thirty trillion, two hundred forty-one billion, one hundred twelve million, three hundred forty-three thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •