Base | Representation |
---|---|
bin | 100101100001111100101011… |
… | …0000111010110011001101101 |
3 | 1121021212021120111110212101211 |
4 | 1023003321112013112121231 |
5 | 321232201230043304433 |
6 | 3130035332331434421 |
7 | 126351320414243644 |
oct | 11303712607263155 |
9 | 1537767514425354 |
10 | 330121221072493 |
11 | 96206695064514 |
12 | 31037854bb5a11 |
13 | 112283b39c0216 |
14 | 5b73d4938235b |
15 | 28273258dc8cd |
hex | 12c3e561d666d |
330121221072493 has 2 divisors, whose sum is σ = 330121221072494. Its totient is φ = 330121221072492.
The previous prime is 330121221072449. The next prime is 330121221072583. The reversal of 330121221072493 is 394270122121033.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 330058891955529 + 62329116964 = 18167523^2 + 249658^2 .
It is a cyclic number.
It is not a de Polignac number, because 330121221072493 - 225 = 330121187518061 is a prime.
It is a super-2 number, since 2×3301212210724932 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330121221072413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165060610536246 + 165060610536247.
It is an arithmetic number, because the mean of its divisors is an integer number (165060610536247).
Almost surely, 2330121221072493 is an apocalyptic number.
It is an amenable number.
330121221072493 is a deficient number, since it is larger than the sum of its proper divisors (1).
330121221072493 is an equidigital number, since it uses as much as digits as its factorization.
330121221072493 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108864, while the sum is 40.
The spelling of 330121221072493 in words is "three hundred thirty trillion, one hundred twenty-one billion, two hundred twenty-one million, seventy-two thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •