Base | Representation |
---|---|
bin | 10011101100110… |
… | …001100110110111 |
3 | 212000220101010021 |
4 | 103230301212313 |
5 | 1134102122011 |
6 | 52443510011 |
7 | 11122146232 |
oct | 2354614667 |
9 | 760811107 |
10 | 330504631 |
11 | 15a61a026 |
12 | 92828307 |
13 | 5361b692 |
14 | 31c74419 |
15 | 1e037471 |
hex | 13b319b7 |
330504631 has 2 divisors, whose sum is σ = 330504632. Its totient is φ = 330504630.
The previous prime is 330504593. The next prime is 330504659. The reversal of 330504631 is 136405033.
It is a strong prime.
It is an emirp because it is prime and its reverse (136405033) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 330504631 - 217 = 330373559 is a prime.
It is a super-2 number, since 2×3305046312 = 218466622224892322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 330504596 and 330504605.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (330504931) 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, 165252315 + 165252316.
It is an arithmetic number, because the mean of its divisors is an integer number (165252316).
Almost surely, 2330504631 is an apocalyptic number.
330504631 is a deficient number, since it is larger than the sum of its proper divisors (1).
330504631 is an equidigital number, since it uses as much as digits as its factorization.
330504631 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 25.
The square root of 330504631 is about 18179.7863298775. The cubic root of 330504631 is about 691.3943874215.
Adding to 330504631 its reverse (136405033), we get a palindrome (466909664).
The spelling of 330504631 in words is "three hundred thirty million, five hundred four thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •