Base | Representation |
---|---|
bin | 10110111111110… |
… | …011111110110101 |
3 | 222220000000210022 |
4 | 112333303332311 |
5 | 1242232423431 |
6 | 102141334525 |
7 | 12363321206 |
oct | 2677637665 |
9 | 886000708 |
10 | 385826741 |
11 | 188875383 |
12 | a9267445 |
13 | 61c1b361 |
14 | 393555ad |
15 | 23d1407b |
hex | 16ff3fb5 |
385826741 has 2 divisors, whose sum is σ = 385826742. Its totient is φ = 385826740.
The previous prime is 385826731. The next prime is 385826743. The reversal of 385826741 is 147628583.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 384552100 + 1274641 = 19610^2 + 1129^2 .
It is an emirp because it is prime and its reverse (147628583) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 385826741 - 26 = 385826677 is a prime.
It is a Sophie Germain prime.
Together with 385826743, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 385826692 and 385826701.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (385826743) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 192913370 + 192913371.
It is an arithmetic number, because the mean of its divisors is an integer number (192913371).
Almost surely, 2385826741 is an apocalyptic number.
It is an amenable number.
385826741 is a deficient number, since it is larger than the sum of its proper divisors (1).
385826741 is an equidigital number, since it uses as much as digits as its factorization.
385826741 is an evil number, because the sum of its binary digits is even.
The product of its digits is 322560, while the sum is 44.
The square root of 385826741 is about 19642.4728840337. The cubic root of 385826741 is about 727.9989867605.
The spelling of 385826741 in words is "three hundred eighty-five million, eight hundred twenty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •