Base | Representation |
---|---|
bin | 100101101001101… |
… | …100011111100101 |
3 | 1122000122000212001 |
4 | 211221230133211 |
5 | 2243202442031 |
6 | 142403125301 |
7 | 21440152321 |
oct | 4551543745 |
9 | 1560560761 |
10 | 631687141 |
11 | 2a4630998 |
12 | 157673831 |
13 | a0b41797 |
14 | 5dc74981 |
15 | 3a6cb861 |
hex | 25a6c7e5 |
631687141 has 2 divisors, whose sum is σ = 631687142. Its totient is φ = 631687140.
The previous prime is 631687079. The next prime is 631687151. The reversal of 631687141 is 141786136.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 412943041 + 218744100 = 20321^2 + 14790^2 .
It is a cyclic number.
It is not a de Polignac number, because 631687141 - 27 = 631687013 is a prime.
It is equal to p32890564 and since 631687141 and 32890564 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 631687141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (631687151) 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 as a sum of consecutive naturals, namely, 315843570 + 315843571.
It is an arithmetic number, because the mean of its divisors is an integer number (315843571).
Almost surely, 2631687141 is an apocalyptic number.
It is an amenable number.
631687141 is a deficient number, since it is larger than the sum of its proper divisors (1).
631687141 is an equidigital number, since it uses as much as digits as its factorization.
631687141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 24192, while the sum is 37.
The square root of 631687141 is about 25133.3869782805. The cubic root of 631687141 is about 858.0264556985.
The spelling of 631687141 in words is "six hundred thirty-one million, six hundred eighty-seven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •