Base | Representation |
---|---|
bin | 100101100111001… |
… | …100010011010101 |
3 | 1121222101200210102 |
4 | 211213030103111 |
5 | 2243020442442 |
6 | 142341103445 |
7 | 21431450342 |
oct | 4547142325 |
9 | 1558350712 |
10 | 631030997 |
11 | 2a4222a23 |
12 | 1573b7b85 |
13 | a0971c2c |
14 | 5db437c9 |
15 | 3a5ec232 |
hex | 259cc4d5 |
631030997 has 2 divisors, whose sum is σ = 631030998. Its totient is φ = 631030996.
The previous prime is 631030937. The next prime is 631030999. The reversal of 631030997 is 799030136.
631030997 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., 483384196 + 147646801 = 21986^2 + 12151^2 .
It is a cyclic number.
It is not a de Polignac number, because 631030997 - 220 = 629982421 is a prime.
Together with 631030999, 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 631030997.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (631030999) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315515498 + 315515499.
It is an arithmetic number, because the mean of its divisors is an integer number (315515499).
Almost surely, 2631030997 is an apocalyptic number.
It is an amenable number.
631030997 is a deficient number, since it is larger than the sum of its proper divisors (1).
631030997 is an equidigital number, since it uses as much as digits as its factorization.
631030997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30618, while the sum is 38.
The square root of 631030997 is about 25120.3303521271. The cubic root of 631030997 is about 857.7292706336.
The spelling of 631030997 in words is "six hundred thirty-one million, thirty thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •