Base | Representation |
---|---|
bin | 111000100010110110000… |
… | …100010011011100111011 |
3 | 111202110200110111222201002 |
4 | 320202312010103130323 |
5 | 1002130410441022042 |
6 | 12133022423515215 |
7 | 550506251453552 |
oct | 70426604233473 |
9 | 14673613458632 |
10 | 3885705017147 |
11 | 1268a11200358 |
12 | 5290aa8b8b0b |
13 | 222560847b75 |
14 | d60d797ad99 |
15 | 6b121cc0132 |
hex | 388b611373b |
3885705017147 has 8 divisors (see below), whose sum is σ = 3896202207744. Its totient is φ = 3875209659328.
The previous prime is 3885705017113. The next prime is 3885705017149. The reversal of 3885705017147 is 7417105075883.
3885705017147 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 3885705017147 - 28 = 3885705016891 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3885705017092 and 3885705017101.
It is not an unprimeable number, because it can be changed into a prime (3885705017149) 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, 3842183 + ... + 4746975.
It is an arithmetic number, because the mean of its divisors is an integer number (487025275968).
Almost surely, 23885705017147 is an apocalyptic number.
3885705017147 is a deficient number, since it is larger than the sum of its proper divisors (10497190597).
3885705017147 is a wasteful number, since it uses less digits than its factorization.
3885705017147 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 916389.
The product of its (nonzero) digits is 6585600, while the sum is 56.
The spelling of 3885705017147 in words is "three trillion, eight hundred eighty-five billion, seven hundred five million, seventeen thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •