Base | Representation |
---|---|
bin | 10111001100001… |
… | …001100010111101 |
3 | 1000010002100002011 |
4 | 113030021202331 |
5 | 1244044421142 |
6 | 102334531221 |
7 | 12432651016 |
oct | 2714114275 |
9 | 1003070064 |
10 | 389060797 |
11 | 18a684154 |
12 | aa366b11 |
13 | 627b13b8 |
14 | 3995800d |
15 | 24252417 |
hex | 173098bd |
389060797 has 2 divisors, whose sum is σ = 389060798. Its totient is φ = 389060796.
The previous prime is 389060779. The next prime is 389060803. The reversal of 389060797 is 797060983.
Together with previous prime (389060779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 376592836 + 12467961 = 19406^2 + 3531^2 .
It is an emirp because it is prime and its reverse (797060983) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 389060797 - 27 = 389060669 is a prime.
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 389060797.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (389060297) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 194530398 + 194530399.
It is an arithmetic number, because the mean of its divisors is an integer number (194530399).
Almost surely, 2389060797 is an apocalyptic number.
It is an amenable number.
389060797 is a deficient number, since it is larger than the sum of its proper divisors (1).
389060797 is an equidigital number, since it uses as much as digits as its factorization.
389060797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 571536, while the sum is 49.
The square root of 389060797 is about 19724.6241282312. The cubic root of 389060797 is about 730.0273943557.
The spelling of 389060797 in words is "three hundred eighty-nine million, sixty thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •