Base | Representation |
---|---|
bin | 10011111111110… |
… | …000101100111101 |
3 | 212101021020022201 |
4 | 103333300230331 |
5 | 1141340403121 |
6 | 53142311501 |
7 | 11212355434 |
oct | 2377605475 |
9 | 771236281 |
10 | 335481661 |
11 | 162409379 |
12 | 94428591 |
13 | 54671b78 |
14 | 327ac11b |
15 | 1e6bbe91 |
hex | 13ff0b3d |
335481661 has 2 divisors, whose sum is σ = 335481662. Its totient is φ = 335481660.
The previous prime is 335481649. The next prime is 335481667. The reversal of 335481661 is 166184533.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 335439225 + 42436 = 18315^2 + 206^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-335481661 is a prime.
It is a super-2 number, since 2×3354816612 = 225095889734637842, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 335481661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (335481667) 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, 167740830 + 167740831.
It is an arithmetic number, because the mean of its divisors is an integer number (167740831).
Almost surely, 2335481661 is an apocalyptic number.
It is an amenable number.
335481661 is a deficient number, since it is larger than the sum of its proper divisors (1).
335481661 is an equidigital number, since it uses as much as digits as its factorization.
335481661 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 51840, while the sum is 37.
The square root of 335481661 is about 18316.1584673206. The cubic root of 335481661 is about 694.8476528899.
The spelling of 335481661 in words is "three hundred thirty-five million, four hundred eighty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •