Base | Representation |
---|---|
bin | 101111110001110000110… |
… | …010001001101101110000 |
3 | 102121212122010212100201122 |
4 | 233301300302021231300 |
5 | 412243042241144303 |
6 | 10552145234121412 |
7 | 456130632545222 |
oct | 57616062115560 |
9 | 12555563770648 |
10 | 3283247209328 |
11 | 1056465501429 |
12 | 450394a20268 |
13 | 1aa7bb941808 |
14 | b4ca510a412 |
15 | 5a6112ace38 |
hex | 2fc70c89b70 |
3283247209328 has 20 divisors (see below), whose sum is σ = 6735485084400. Its totient is φ = 1545057510144.
The previous prime is 3283247209321. The next prime is 3283247209339. The reversal of 3283247209328 is 8239027423823.
3283247209328 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a self number, because there is not a number n which added to its sum of digits gives 3283247209328.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3283247209321) 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, 6035380628 + ... + 6035381171.
It is an arithmetic number, because the mean of its divisors is an integer number (336774254220).
Almost surely, 23283247209328 is an apocalyptic number.
It is an amenable number.
3283247209328 is an abundant number, since it is smaller than the sum of its proper divisors (3452237875072).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3283247209328 is a wasteful number, since it uses less digits than its factorization.
3283247209328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12070761824 (or 12070761818 counting only the distinct ones).
The product of its (nonzero) digits is 6967296, while the sum is 53.
The spelling of 3283247209328 in words is "three trillion, two hundred eighty-three billion, two hundred forty-seven million, two hundred nine thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •