Base | Representation |
---|---|
bin | 10110111111010… |
… | …001001010110011 |
3 | 222212201210012001 |
4 | 112333101022303 |
5 | 1242213343042 |
6 | 102134314431 |
7 | 12362155402 |
oct | 2677211263 |
9 | 885653161 |
10 | 385684147 |
11 | 188788232 |
12 | a91b8a17 |
13 | 61b9b494 |
14 | 39319639 |
15 | 23cd6bb7 |
hex | 16fd12b3 |
385684147 has 2 divisors, whose sum is σ = 385684148. Its totient is φ = 385684146.
The previous prime is 385684139. The next prime is 385684153. The reversal of 385684147 is 741486583.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 385684147 - 23 = 385684139 is a prime.
It is a super-2 number, since 2×3856841472 = 297504522494235218, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 385684097 and 385684106.
It is not a weakly prime, because it can be changed into another prime (385684177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 192842073 + 192842074.
It is an arithmetic number, because the mean of its divisors is an integer number (192842074).
Almost surely, 2385684147 is an apocalyptic number.
385684147 is a deficient number, since it is larger than the sum of its proper divisors (1).
385684147 is an equidigital number, since it uses as much as digits as its factorization.
385684147 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 645120, while the sum is 46.
The square root of 385684147 is about 19638.8428121415. The cubic root of 385684147 is about 727.9092909915.
The spelling of 385684147 in words is "three hundred eighty-five million, six hundred eighty-four thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •