Base | Representation |
---|---|
bin | 1100100110101001… |
… | …0111010101101001 |
3 | 22201210022202211111 |
4 | 3021222113111221 |
5 | 23412112413212 |
6 | 1315420230321 |
7 | 146561540236 |
oct | 31152272551 |
9 | 8653282744 |
10 | 3383326057 |
11 | 1486887a41 |
12 | 7a509b3a1 |
13 | 41bc385a7 |
14 | 2414aa78d |
15 | 14c061ea7 |
hex | c9a97569 |
3383326057 has 4 divisors (see below), whose sum is σ = 3383603200. Its totient is φ = 3383048916.
The previous prime is 3383326039. The next prime is 3383326069. The reversal of 3383326057 is 7506233833.
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.
It is a cyclic number.
It is not a de Polignac number, because 3383326057 - 215 = 3383293289 is a prime.
It is a super-2 number, since 2×33833260572 = 22893790415950334498, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3383326007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 119373 + ... + 144970.
It is an arithmetic number, because the mean of its divisors is an integer number (845900800).
Almost surely, 23383326057 is an apocalyptic number.
It is an amenable number.
3383326057 is a deficient number, since it is larger than the sum of its proper divisors (277143).
3383326057 is a wasteful number, since it uses less digits than its factorization.
3383326057 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 277142.
The product of its (nonzero) digits is 272160, while the sum is 40.
The square root of 3383326057 is about 58166.3653411488. The cubic root of 3383326057 is about 1501.2324769822.
The spelling of 3383326057 in words is "three billion, three hundred eighty-three million, three hundred twenty-six thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •