Base | Representation |
---|---|
bin | 10111000000111… |
… | …010011001000101 |
3 | 222220112200101210 |
4 | 113000322121011 |
5 | 1242321141031 |
6 | 102151442033 |
7 | 12365632056 |
oct | 2700723105 |
9 | 886480353 |
10 | 386115141 |
11 | 188a52025 |
12 | a9386319 |
13 | 61cbc6c9 |
14 | 393cc72d |
15 | 23d6e746 |
hex | 1703a645 |
386115141 has 8 divisors (see below), whose sum is σ = 516376864. Its totient is φ = 256631760.
The previous prime is 386115139. The next prime is 386115143. The reversal of 386115141 is 141511683.
It is an interprime number because it is at equal distance from previous prime (386115139) and next prime (386115143).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 386115141 - 21 = 386115139 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 386115099 and 386115108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (386115143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 193426 + ... + 195411.
It is an arithmetic number, because the mean of its divisors is an integer number (64547108).
Almost surely, 2386115141 is an apocalyptic number.
It is an amenable number.
386115141 is a deficient number, since it is larger than the sum of its proper divisors (130261723).
386115141 is a wasteful number, since it uses less digits than its factorization.
386115141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 389171.
The product of its digits is 2880, while the sum is 30.
The square root of 386115141 is about 19649.8127471994. The cubic root of 386115141 is about 728.1803312124.
The spelling of 386115141 in words is "three hundred eighty-six million, one hundred fifteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •