Base | Representation |
---|---|
bin | 100101101000101… |
… | …110011001100001 |
3 | 1122000011002222001 |
4 | 211220232121201 |
5 | 2243121322201 |
6 | 142353444001 |
7 | 21435042646 |
oct | 4550563141 |
9 | 1560132861 |
10 | 631432801 |
11 | 2a447789a |
12 | 157570601 |
13 | a0a82a9c |
14 | 5dc09dcd |
15 | 3a67b301 |
hex | 25a2e661 |
631432801 has 2 divisors, whose sum is σ = 631432802. Its totient is φ = 631432800.
The previous prime is 631432729. The next prime is 631432829. The reversal of 631432801 is 108234136.
It is an a-pointer prime, because the next prime (631432829) can be obtained adding 631432801 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 622552401 + 8880400 = 24951^2 + 2980^2 .
It is a cyclic number.
It is not a de Polignac number, because 631432801 - 221 = 629335649 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 631432801.
It is not a weakly prime, because it can be changed into another prime (631432001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315716400 + 315716401.
It is an arithmetic number, because the mean of its divisors is an integer number (315716401).
Almost surely, 2631432801 is an apocalyptic number.
It is an amenable number.
631432801 is a deficient number, since it is larger than the sum of its proper divisors (1).
631432801 is an equidigital number, since it uses as much as digits as its factorization.
631432801 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 28.
The square root of 631432801 is about 25128.3266653393. The cubic root of 631432801 is about 857.9112827854.
Adding to 631432801 its reverse (108234136), we get a palindrome (739666937).
The spelling of 631432801 in words is "six hundred thirty-one million, four hundred thirty-two thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •