Base | Representation |
---|---|
bin | 1001100110111001100… |
… | …00100001100010111011 |
3 | 1011120002201022122220012 |
4 | 10303130300201202323 |
5 | 20402042013103311 |
6 | 411353335252135 |
7 | 32564466043145 |
oct | 4633460414273 |
9 | 1146081278805 |
10 | 330121222331 |
11 | 11800490747a |
12 | 53b90b1a04b |
13 | 251903580a4 |
14 | 11d99703c95 |
15 | 88c1c8078b |
hex | 4cdcc218bb |
330121222331 has 2 divisors, whose sum is σ = 330121222332. Its totient is φ = 330121222330.
The previous prime is 330121222309. The next prime is 330121222357. The reversal of 330121222331 is 133222121033.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-330121222331 is a prime.
It is a super-2 number, since 2×3301212223312 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 330121222297 and 330121222306.
It is not a weakly prime, because it can be changed into another prime (330121222031) 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, 165060611165 + 165060611166.
It is an arithmetic number, because the mean of its divisors is an integer number (165060611166).
Almost surely, 2330121222331 is an apocalyptic number.
330121222331 is a deficient number, since it is larger than the sum of its proper divisors (1).
330121222331 is an equidigital number, since it uses as much as digits as its factorization.
330121222331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 330121222331 its reverse (133222121033), we get a palindrome (463343343364).
The spelling of 330121222331 in words is "three hundred thirty billion, one hundred twenty-one million, two hundred twenty-two thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •