Base | Representation |
---|---|
bin | 10011101100011… |
… | …000101101010001 |
3 | 212000201012012212 |
4 | 103230120231101 |
5 | 1134040341031 |
6 | 52441401505 |
7 | 11121243002 |
oct | 2354305521 |
9 | 760635185 |
10 | 330402641 |
11 | 15a55a438 |
12 | 92799295 |
13 | 535b412a |
14 | 31c491a9 |
15 | 1e01712b |
hex | 13b18b51 |
330402641 has 4 divisors (see below), whose sum is σ = 338461284. Its totient is φ = 322344000.
The previous prime is 330402601. The next prime is 330402671. The reversal of 330402641 is 146204033.
It is a happy number.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 146204033 = 113 ⋅1293841.
It can be written as a sum of positive squares in 2 ways, for example, as 34562641 + 295840000 = 5879^2 + 17200^2 .
It is a cyclic number.
It is not a de Polignac number, because 330402641 - 26 = 330402577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (330402601) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4029260 + ... + 4029341.
It is an arithmetic number, because the mean of its divisors is an integer number (84615321).
Almost surely, 2330402641 is an apocalyptic number.
It is an amenable number.
330402641 is a deficient number, since it is larger than the sum of its proper divisors (8058643).
330402641 is an equidigital number, since it uses as much as digits as its factorization.
330402641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8058642.
The product of its (nonzero) digits is 1728, while the sum is 23.
The square root of 330402641 is about 18176.9810749750. The cubic root of 330402641 is about 691.3232612692.
Adding to 330402641 its reverse (146204033), we get a palindrome (476606674).
The spelling of 330402641 in words is "three hundred thirty million, four hundred two thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •