Base | Representation |
---|---|
bin | 100110110001000… |
… | …100110110111001 |
3 | 1200022211200220211 |
4 | 212301010312321 |
5 | 2313000233121 |
6 | 144312151121 |
7 | 22055205316 |
oct | 4661046671 |
9 | 1608750824 |
10 | 650399161 |
11 | 304151575 |
12 | 1619984a1 |
13 | a4993899 |
14 | 62545d0d |
15 | 3c175ce1 |
hex | 26c44db9 |
650399161 has 2 divisors, whose sum is σ = 650399162. Its totient is φ = 650399160.
The previous prime is 650399137. The next prime is 650399171. The reversal of 650399161 is 161993056.
650399161 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., 649485225 + 913936 = 25485^2 + 956^2 .
It is a cyclic number.
It is not a de Polignac number, because 650399161 - 29 = 650398649 is a prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (650399171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 325199580 + 325199581.
It is an arithmetic number, because the mean of its divisors is an integer number (325199581).
Almost surely, 2650399161 is an apocalyptic number.
It is an amenable number.
650399161 is a deficient number, since it is larger than the sum of its proper divisors (1).
650399161 is an equidigital number, since it uses as much as digits as its factorization.
650399161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 40.
The square root of 650399161 is about 25502.9245577836. The cubic root of 650399161 is about 866.4163864247.
The spelling of 650399161 in words is "six hundred fifty million, three hundred ninety-nine thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •