Base | Representation |
---|---|
bin | 1011111011111110… |
… | …0100011010011101 |
3 | 22021022112002121202 |
4 | 2332333210122131 |
5 | 23030302212021 |
6 | 1245544005245 |
7 | 142256254211 |
oct | 27677443235 |
9 | 8238462552 |
10 | 3204335261 |
11 | 13a4844566 |
12 | 755160825 |
13 | 3c0b28b8a |
14 | 2257d6941 |
15 | 13b4a7a0b |
hex | befe469d |
3204335261 has 8 divisors (see below), whose sum is σ = 3221568504. Its totient is φ = 3187148800.
The previous prime is 3204335249. The next prime is 3204335269. The reversal of 3204335261 is 1625334023.
It can be written as a sum of positive squares in 4 ways, for example, as 923795236 + 2280540025 = 30394^2 + 47755^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3204335261 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3204335269) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 130235 + ... + 152871.
It is an arithmetic number, because the mean of its divisors is an integer number (402696063).
Almost surely, 23204335261 is an apocalyptic number.
It is an amenable number.
3204335261 is a deficient number, since it is larger than the sum of its proper divisors (17233243).
3204335261 is a wasteful number, since it uses less digits than its factorization.
3204335261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23391.
The product of its (nonzero) digits is 12960, while the sum is 29.
The square root of 3204335261 is about 56606.8481811167. The cubic root of 3204335261 is about 1474.2777674168.
Adding to 3204335261 its reverse (1625334023), we get a palindrome (4829669284).
The spelling of 3204335261 in words is "three billion, two hundred four million, three hundred thirty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •