Base | Representation |
---|---|
bin | 10111000100001… |
… | …100011000010001 |
3 | 222222011101020122 |
4 | 113010030120101 |
5 | 1243031201444 |
6 | 102222120025 |
7 | 12406143503 |
oct | 2704143021 |
9 | 888141218 |
10 | 386975249 |
11 | 18948a261 |
12 | a9720015 |
13 | 6223104b |
14 | 39573d73 |
15 | 23e8e4ee |
hex | 1710c611 |
386975249 has 2 divisors, whose sum is σ = 386975250. Its totient is φ = 386975248.
The previous prime is 386975227. The next prime is 386975279. The reversal of 386975249 is 942579683.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 386397649 + 577600 = 19657^2 + 760^2 .
It is a cyclic number.
It is not a de Polignac number, because 386975249 - 28 = 386974993 is a prime.
It is a super-2 number, since 2×3869752492 = 299499686677224002, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 386975249.
It is not a weakly prime, because it can be changed into another prime (386975279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 193487624 + 193487625.
It is an arithmetic number, because the mean of its divisors is an integer number (193487625).
Almost surely, 2386975249 is an apocalyptic number.
It is an amenable number.
386975249 is a deficient number, since it is larger than the sum of its proper divisors (1).
386975249 is an equidigital number, since it uses as much as digits as its factorization.
386975249 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3265920, while the sum is 53.
The square root of 386975249 is about 19671.6864808282. The cubic root of 386975249 is about 728.7206270800.
The spelling of 386975249 in words is "three hundred eighty-six million, nine hundred seventy-five thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •