Base | Representation |
---|---|
bin | 1100001110100010… |
… | …1100100010100001 |
3 | 22110202002022200111 |
4 | 3003220230202201 |
5 | 23210222202223 |
6 | 1301405251321 |
7 | 144223312003 |
oct | 30350544241 |
9 | 8422068614 |
10 | 3282225313 |
11 | 1434804504 |
12 | 777263b41 |
13 | 403ccaa73 |
14 | 231cb0373 |
15 | 14324130d |
hex | c3a2c8a1 |
3282225313 has 4 divisors (see below), whose sum is σ = 3306183300. Its totient is φ = 3258267328.
The previous prime is 3282225311. The next prime is 3282225329. The reversal of 3282225313 is 3135222823.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 998054464 + 2284170849 = 31592^2 + 47793^2 .
It is a cyclic number.
It is not a de Polignac number, because 3282225313 - 21 = 3282225311 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3282225311) 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 3 ways as a sum of consecutive naturals, for example, 11978788 + ... + 11979061.
It is an arithmetic number, because the mean of its divisors is an integer number (826545825).
Almost surely, 23282225313 is an apocalyptic number.
It is an amenable number.
3282225313 is a deficient number, since it is larger than the sum of its proper divisors (23957987).
3282225313 is a wasteful number, since it uses less digits than its factorization.
3282225313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23957986.
The product of its digits is 17280, while the sum is 31.
The square root of 3282225313 is about 57290.7087842348. The cubic root of 3282225313 is about 1486.1277036845.
The spelling of 3282225313 in words is "three billion, two hundred eighty-two million, two hundred twenty-five thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •