Base | Representation |
---|---|
bin | 1100001110101000… |
… | …0000010011001101 |
3 | 22110202201202022022 |
4 | 3003222000103031 |
5 | 23210314142042 |
6 | 1301420455525 |
7 | 144226241153 |
oct | 30352002315 |
9 | 8422652268 |
10 | 3282568397 |
11 | 1434a19249 |
12 | 7773aa5a5 |
13 | 4040bac84 |
14 | 231d5d3d3 |
15 | 1432accd2 |
hex | c3a804cd |
3282568397 has 8 divisors (see below), whose sum is σ = 3306608760. Its totient is φ = 3258593280.
The previous prime is 3282568381. The next prime is 3282568433. The reversal of 3282568397 is 7938652823.
It can be written as a sum of positive squares in 4 ways, for example, as 250304041 + 3032264356 = 15821^2 + 55066^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3282568397 - 24 = 3282568381 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 (3282565397) 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 in 7 ways as a sum of consecutive naturals, for example, 87053 + ... + 118925.
It is an arithmetic number, because the mean of its divisors is an integer number (413326095).
Almost surely, 23282568397 is an apocalyptic number.
It is an amenable number.
3282568397 is a deficient number, since it is larger than the sum of its proper divisors (24040363).
3282568397 is a wasteful number, since it uses less digits than its factorization.
3282568397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32623.
The product of its digits is 4354560, while the sum is 53.
The square root of 3282568397 is about 57293.7029436918. The cubic root of 3282568397 is about 1486.1794824651.
The spelling of 3282568397 in words is "three billion, two hundred eighty-two million, five hundred sixty-eight thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •