Base | Representation |
---|---|
bin | 10111001111101… |
… | …110110000101001 |
3 | 1000011212000221202 |
4 | 113033232300221 |
5 | 1244314442112 |
6 | 102411013545 |
7 | 12443641145 |
oct | 2717566051 |
9 | 1004760852 |
10 | 389999657 |
11 | 190165573 |
12 | aa73a2b5 |
13 | 62a4c838 |
14 | 39b20225 |
15 | 2438a6c2 |
hex | 173eec29 |
389999657 has 8 divisors (see below), whose sum is σ = 397841352. Its totient is φ = 382204800.
The previous prime is 389999641. The next prime is 389999693. The reversal of 389999657 is 756999983.
It can be written as a sum of positive squares in 4 ways, for example, as 3444736 + 386554921 = 1856^2 + 19661^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 389999657 - 24 = 389999641 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 389999593 and 389999602.
It is not an unprimeable number, because it can be changed into a prime (389992657) 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 in 7 ways as a sum of consecutive naturals, for example, 5357 + ... + 28437.
It is an arithmetic number, because the mean of its divisors is an integer number (49730169).
Almost surely, 2389999657 is an apocalyptic number.
It is an amenable number.
389999657 is a deficient number, since it is larger than the sum of its proper divisors (7841695).
389999657 is a wasteful number, since it uses less digits than its factorization.
389999657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23419.
The product of its digits is 33067440, while the sum is 65.
The square root of 389999657 is about 19748.4089738895. The cubic root of 389999657 is about 730.6141432176.
The spelling of 389999657 in words is "three hundred eighty-nine million, nine hundred ninety-nine thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •