Base | Representation |
---|---|
bin | 1100001110101000… |
… | …0001111011010001 |
3 | 22110202202002102222 |
4 | 3003222001323101 |
5 | 23210314400212 |
6 | 1301420550425 |
7 | 144226266446 |
oct | 30352017321 |
9 | 8422662388 |
10 | 3282575057 |
11 | 1434a23253 |
12 | 7773b2415 |
13 | 4040c1008 |
14 | 231d619cd |
15 | 1432aec72 |
hex | c3a81ed1 |
3282575057 has 4 divisors (see below), whose sum is σ = 3324126720. Its totient is φ = 3241023396.
The previous prime is 3282575053. The next prime is 3282575063. The reversal of 3282575057 is 7505752823.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 7505752823 = 193 ⋅38889911.
It is a cyclic number.
It is not a de Polignac number, because 3282575057 - 22 = 3282575053 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3282574999 and 3282575017.
It is not an unprimeable number, because it can be changed into a prime (3282575053) 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, 20775713 + ... + 20775870.
It is an arithmetic number, because the mean of its divisors is an integer number (831031680).
Almost surely, 23282575057 is an apocalyptic number.
It is an amenable number.
3282575057 is a deficient number, since it is larger than the sum of its proper divisors (41551663).
3282575057 is an equidigital number, since it uses as much as digits as its factorization.
3282575057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41551662.
The product of its (nonzero) digits is 588000, while the sum is 44.
The square root of 3282575057 is about 57293.7610652329. The cubic root of 3282575057 is about 1486.1804875671.
The spelling of 3282575057 in words is "three billion, two hundred eighty-two million, five hundred seventy-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •