Base | Representation |
---|---|
bin | 101111100000011001101… |
… | …001111110000011000101 |
3 | 102120002111222100100011222 |
4 | 233200121221332003011 |
5 | 411441403011434123 |
6 | 10535423351210125 |
7 | 454600653361145 |
oct | 57403151760305 |
9 | 12502458310158 |
10 | 3264605577413 |
11 | 1049569816464 |
12 | 448851976945 |
13 | 1a8b0a7ca09b |
14 | b40173ba925 |
15 | 59dbe9116c8 |
hex | 2f819a7e0c5 |
3264605577413 has 4 divisors (see below), whose sum is σ = 3406544950368. Its totient is φ = 3122666204460.
The previous prime is 3264605577403. The next prime is 3264605577419. The reversal of 3264605577413 is 3147755064623.
3264605577413 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
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 3264605577413 - 218 = 3264605315269 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3264605577419) 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, 70969686443 + ... + 70969686488.
It is an arithmetic number, because the mean of its divisors is an integer number (851636237592).
Almost surely, 23264605577413 is an apocalyptic number.
It is an amenable number.
3264605577413 is a deficient number, since it is larger than the sum of its proper divisors (141939372955).
3264605577413 is a wasteful number, since it uses less digits than its factorization.
3264605577413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141939372954.
The product of its (nonzero) digits is 12700800, while the sum is 53.
The spelling of 3264605577413 in words is "three trillion, two hundred sixty-four billion, six hundred five million, five hundred seventy-seven thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •