Base | Representation |
---|---|
bin | 10110111111011… |
… | …110010000010101 |
3 | 222212211111201022 |
4 | 112333132100111 |
5 | 1242222101444 |
6 | 102135410525 |
7 | 12362500565 |
oct | 2677362025 |
9 | 885744638 |
10 | 385737749 |
11 | 188814531 |
12 | a9223a45 |
13 | 61bb99b7 |
14 | 39330da5 |
15 | 23ce79ee |
hex | 16fde415 |
385737749 has 2 divisors, whose sum is σ = 385737750. Its totient is φ = 385737748.
The previous prime is 385737733. The next prime is 385737809. The reversal of 385737749 is 947737583.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 284091025 + 101646724 = 16855^2 + 10082^2 .
It is a cyclic number.
It is not a de Polignac number, because 385737749 - 24 = 385737733 is a prime.
It is a super-2 number, since 2×3857377492 = 297587222007174002, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 385737749.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (385737719) 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, 192868874 + 192868875.
It is an arithmetic number, because the mean of its divisors is an integer number (192868875).
Almost surely, 2385737749 is an apocalyptic number.
It is an amenable number.
385737749 is a deficient number, since it is larger than the sum of its proper divisors (1).
385737749 is an equidigital number, since it uses as much as digits as its factorization.
385737749 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 4445280, while the sum is 53.
The square root of 385737749 is about 19640.2074581711. The cubic root of 385737749 is about 727.9430107997.
The spelling of 385737749 in words is "three hundred eighty-five million, seven hundred thirty-seven thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •