Base | Representation |
---|---|
bin | 100101101101100… |
… | …011001000101101 |
3 | 1122002112100122122 |
4 | 211231203020231 |
5 | 2243432304024 |
6 | 142440522325 |
7 | 21451560542 |
oct | 4555431055 |
9 | 1562470578 |
10 | 632697389 |
11 | 2a5160a05 |
12 | 157a803a5 |
13 | a110656c |
14 | 60058bc9 |
15 | 3a82ad5e |
hex | 25b6322d |
632697389 has 2 divisors, whose sum is σ = 632697390. Its totient is φ = 632697388.
The previous prime is 632697353. The next prime is 632697391. The reversal of 632697389 is 983796236.
632697389 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 487084900 + 145612489 = 22070^2 + 12067^2 .
It is a cyclic number.
It is not a de Polignac number, because 632697389 - 220 = 631648813 is a prime.
Together with 632697391, it forms a pair of twin primes.
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 632697389.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (632697319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 316348694 + 316348695.
It is an arithmetic number, because the mean of its divisors is an integer number (316348695).
Almost surely, 2632697389 is an apocalyptic number.
It is an amenable number.
632697389 is a deficient number, since it is larger than the sum of its proper divisors (1).
632697389 is an equidigital number, since it uses as much as digits as its factorization.
632697389 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2939328, while the sum is 53.
The square root of 632697389 is about 25153.4766781851. The cubic root of 632697389 is about 858.4836217899.
The spelling of 632697389 in words is "six hundred thirty-two million, six hundred ninety-seven thousand, three hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.049 sec. • engine limits •