Base | Representation |
---|---|
bin | 1001100111010010011… |
… | …10001101100001011111 |
3 | 1011120122021210111101021 |
4 | 10303221032031201133 |
5 | 20403004031044411 |
6 | 411430205225011 |
7 | 32602615326115 |
oct | 4635116154137 |
9 | 1146567714337 |
10 | 330330331231 |
11 | 11810195104a |
12 | 5402ab62167 |
13 | 251c4781474 |
14 | 11db93b7ab5 |
15 | 88d52d8a71 |
hex | 4ce938d85f |
330330331231 has 2 divisors, whose sum is σ = 330330331232. Its totient is φ = 330330331230.
The previous prime is 330330331213. The next prime is 330330331241. The reversal of 330330331231 is 132133033033.
Together with previous prime (330330331213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 330330331231 - 213 = 330330323039 is a prime.
It is a super-2 number, since 2×3303303312312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330330331196 and 330330331205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330330331211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165165165615 + 165165165616.
It is an arithmetic number, because the mean of its divisors is an integer number (165165165616).
Almost surely, 2330330331231 is an apocalyptic number.
330330331231 is a deficient number, since it is larger than the sum of its proper divisors (1).
330330331231 is an equidigital number, since it uses as much as digits as its factorization.
330330331231 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4374, while the sum is 25.
Adding to 330330331231 its reverse (132133033033), we get a palindrome (462463364264).
The spelling of 330330331231 in words is "three hundred thirty billion, three hundred thirty million, three hundred thirty-one thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •