Base | Representation |
---|---|
bin | 1001100110110000011… |
… | …11101101100000000001 |
3 | 1011112220102212011102001 |
4 | 10303120033231200001 |
5 | 20401413122333211 |
6 | 411342032424001 |
7 | 32562556363324 |
oct | 4633017554001 |
9 | 1145812764361 |
10 | 330045511681 |
11 | 117a760a5996 |
12 | 53b6b6a8001 |
13 | 2517a76a1a2 |
14 | 11d8d6367bb |
15 | 88ba2c7ac1 |
hex | 4cd83ed801 |
330045511681 has 2 divisors, whose sum is σ = 330045511682. Its totient is φ = 330045511680.
The previous prime is 330045511669. The next prime is 330045511687. The reversal of 330045511681 is 186115540033.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 189559227456 + 140486284225 = 435384^2 + 374815^2 .
It is a cyclic number.
It is not a de Polignac number, because 330045511681 - 27 = 330045511553 is a prime.
It is a super-2 number, since 2×3300455116812 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 330045511681.
It is not a weakly prime, because it can be changed into another prime (330045511687) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165022755840 + 165022755841.
It is an arithmetic number, because the mean of its divisors is an integer number (165022755841).
Almost surely, 2330045511681 is an apocalyptic number.
It is an amenable number.
330045511681 is a deficient number, since it is larger than the sum of its proper divisors (1).
330045511681 is an equidigital number, since it uses as much as digits as its factorization.
330045511681 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43200, while the sum is 37.
The spelling of 330045511681 in words is "three hundred thirty billion, forty-five million, five hundred eleven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •