Base | Representation |
---|---|
bin | 10011101011101… |
… | …111101001011101 |
3 | 212000101122111222 |
4 | 103223233221131 |
5 | 1134020000321 |
6 | 52434023125 |
7 | 11116642454 |
oct | 2353575135 |
9 | 760348458 |
10 | 330234461 |
11 | 15a455047 |
12 | 92717aa5 |
13 | 5355570b |
14 | 31c03b9b |
15 | 1ded23ab |
hex | 13aefa5d |
330234461 has 2 divisors, whose sum is σ = 330234462. Its totient is φ = 330234460.
The previous prime is 330234439. The next prime is 330234479. The reversal of 330234461 is 164432033.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 329604025 + 630436 = 18155^2 + 794^2 .
It is a cyclic number.
It is not a de Polignac number, because 330234461 - 210 = 330233437 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 330234461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (336234461) 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, 165117230 + 165117231.
It is an arithmetic number, because the mean of its divisors is an integer number (165117231).
Almost surely, 2330234461 is an apocalyptic number.
It is an amenable number.
330234461 is a deficient number, since it is larger than the sum of its proper divisors (1).
330234461 is an equidigital number, since it uses as much as digits as its factorization.
330234461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 26.
The square root of 330234461 is about 18172.3543053728. The cubic root of 330234461 is about 691.2059433219.
Adding to 330234461 its reverse (164432033), we get a palindrome (494666494).
The spelling of 330234461 in words is "three hundred thirty million, two hundred thirty-four thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •