Base | Representation |
---|---|
bin | 101110101010001011100… |
… | …001011101011100000011 |
3 | 102100112020120201001121110 |
4 | 232222023201131130003 |
5 | 410013134410012141 |
6 | 10452554340254403 |
7 | 450440146526013 |
oct | 56521341353403 |
9 | 12315216631543 |
10 | 3206386407171 |
11 | 102690359a132 |
12 | 4395043a1403 |
13 | 1a348ccaa41c |
14 | b129324dc43 |
15 | 586136cbe16 |
hex | 2ea8b85d703 |
3206386407171 has 8 divisors (see below), whose sum is σ = 4317510410064. Its totient is φ = 2116426671200.
The previous prime is 3206386407163. The next prime is 3206386407209. The reversal of 3206386407171 is 1717046836023.
3206386407171 is digitally balanced in base 2, 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 3206386407171 - 23 = 3206386407163 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3206386407171.
It is not an unprimeable number, because it can be changed into a prime (3206386407131) 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, 5291066376 + ... + 5291066981.
It is an arithmetic number, because the mean of its divisors is an integer number (539688801258).
Almost surely, 23206386407171 is an apocalyptic number.
3206386407171 is a deficient number, since it is larger than the sum of its proper divisors (1111124002893).
3206386407171 is a wasteful number, since it uses less digits than its factorization.
3206386407171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10582133461.
The product of its (nonzero) digits is 1016064, while the sum is 48.
The spelling of 3206386407171 in words is "three trillion, two hundred six billion, three hundred eighty-six million, four hundred seven thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •