Base | Representation |
---|---|
bin | 1100010000100000… |
… | …0000010111101001 |
3 | 22111022112022111221 |
4 | 3010020000113221 |
5 | 23214322324001 |
6 | 1302301222041 |
7 | 144353135062 |
oct | 30410002751 |
9 | 8438468457 |
10 | 3290433001 |
11 | 1439400019 |
12 | 779b61921 |
13 | 40591289b |
14 | 233009569 |
15 | 143d131a1 |
hex | c42005e9 |
3290433001 has 4 divisors (see below), whose sum is σ = 3294264400. Its totient is φ = 3286601604.
The previous prime is 3290432941. The next prime is 3290433023. The reversal of 3290433001 is 1003340923.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 3290433001 - 211 = 3290430953 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3290433701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1914411 + ... + 1916128.
It is an arithmetic number, because the mean of its divisors is an integer number (823566100).
Almost surely, 23290433001 is an apocalyptic number.
It is an amenable number.
3290433001 is a deficient number, since it is larger than the sum of its proper divisors (3831399).
3290433001 is an equidigital number, since it uses as much as digits as its factorization.
3290433001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3831398.
The product of its (nonzero) digits is 1944, while the sum is 25.
The square root of 3290433001 is about 57362.2959878699. The cubic root of 3290433001 is about 1487.3654329789.
Adding to 3290433001 its reverse (1003340923), we get a palindrome (4293773924).
The spelling of 3290433001 in words is "three billion, two hundred ninety million, four hundred thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •