Base | Representation |
---|---|
bin | 101111101111011001100… |
… | …110010101001101010001 |
3 | 102121122002101001221002201 |
4 | 233233121212111031101 |
5 | 412222343423013212 |
6 | 10551045425043201 |
7 | 456011033162155 |
oct | 57573146251521 |
9 | 12548071057081 |
10 | 3280710751057 |
11 | 1055383766823 |
12 | 44b9a7486501 |
13 | 1aa4a62b892c |
14 | b4b042c9065 |
15 | 5a51377eb57 |
hex | 2fbd9995351 |
3280710751057 has 8 divisors (see below), whose sum is σ = 3394003132800. Its totient is φ = 3167429331024.
The previous prime is 3280710751037. The next prime is 3280710751099. The reversal of 3280710751057 is 7501570170823.
3280710751057 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3280710751057 - 215 = 3280710718289 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3280710750998 and 3280710751016.
It is not an unprimeable number, because it can be changed into a prime (3280710751037) 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, 2129203 + ... + 3330904.
It is an arithmetic number, because the mean of its divisors is an integer number (424250391600).
Almost surely, 23280710751057 is an apocalyptic number.
It is an amenable number.
3280710751057 is a deficient number, since it is larger than the sum of its proper divisors (113292381743).
3280710751057 is a wasteful number, since it uses less digits than its factorization.
3280710751057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5480855.
The product of its (nonzero) digits is 411600, while the sum is 46.
The spelling of 3280710751057 in words is "three trillion, two hundred eighty billion, seven hundred ten million, seven hundred fifty-one thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •