Base | Representation |
---|---|
bin | 10011101100011… |
… | …101000010001001 |
3 | 212000202002112011 |
4 | 103230131002021 |
5 | 1134041422421 |
6 | 52442015521 |
7 | 11121345445 |
oct | 2354350211 |
9 | 760662464 |
10 | 330420361 |
11 | 15a571787 |
12 | 927a75a1 |
13 | 535bc20b |
14 | 31c51825 |
15 | 1e01c4e1 |
hex | 13b1d089 |
330420361 has 2 divisors, whose sum is σ = 330420362. Its totient is φ = 330420360.
The previous prime is 330420359. The next prime is 330420371. The reversal of 330420361 is 163024033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 263900025 + 66520336 = 16245^2 + 8156^2 .
It is a cyclic number.
It is not a de Polignac number, because 330420361 - 21 = 330420359 is a prime.
It is a super-2 number, since 2×3304203612 = 218355229926740642, which contains 22 as substring.
Together with 330420359, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (330420301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 165210180 + 165210181.
It is an arithmetic number, because the mean of its divisors is an integer number (165210181).
Almost surely, 2330420361 is an apocalyptic number.
It is an amenable number.
330420361 is a deficient number, since it is larger than the sum of its proper divisors (1).
330420361 is an equidigital number, since it uses as much as digits as its factorization.
330420361 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 22.
The square root of 330420361 is about 18177.4684981160. The cubic root of 330420361 is about 691.3356199569.
Adding to 330420361 its reverse (163024033), we get a palindrome (493444394).
The spelling of 330420361 in words is "three hundred thirty million, four hundred twenty thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •