Base | Representation |
---|---|
bin | 101111100000011101100… |
… | …100110100001100101101 |
3 | 102120002200120002011221001 |
4 | 233200131210310030231 |
5 | 411442021330211323 |
6 | 10535434100440301 |
7 | 454602412325641 |
oct | 57403544641455 |
9 | 12502616064831 |
10 | 3264671335213 |
11 | 10495a294a252 |
12 | 44886b9a9091 |
13 | 1a8b1b311a22 |
14 | b4022016c21 |
15 | 59dc55a03ad |
hex | 2f81d93432d |
3264671335213 has 32 divisors (see below), whose sum is σ = 3406923666432. Its totient is φ = 3125931177600.
The previous prime is 3264671335187. The next prime is 3264671335229. The reversal of 3264671335213 is 3125331764623.
It is a happy number.
3264671335213 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3264671335213 is a prime.
It is a super-2 number, since 2×32646713352132 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3264671305213) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 619127145 + ... + 619132417.
It is an arithmetic number, because the mean of its divisors is an integer number (106466364576).
Almost surely, 23264671335213 is an apocalyptic number.
It is an amenable number.
3264671335213 is a deficient number, since it is larger than the sum of its proper divisors (142252331219).
3264671335213 is a wasteful number, since it uses less digits than its factorization.
3264671335213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6385.
The product of its digits is 1632960, while the sum is 46.
The spelling of 3264671335213 in words is "three trillion, two hundred sixty-four billion, six hundred seventy-one million, three hundred thirty-five thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •