Base | Representation |
---|---|
bin | 100101101001101… |
… | …000010101110011 |
3 | 1122000121011112001 |
4 | 211221220111303 |
5 | 2243201421011 |
6 | 142402514431 |
7 | 21440051611 |
oct | 4551502563 |
9 | 1560534461 |
10 | 631670131 |
11 | 2a461a134 |
12 | 157665a17 |
13 | a0b36b11 |
14 | 5dc6c6b1 |
15 | 3a6c67c1 |
hex | 25a68573 |
631670131 has 2 divisors, whose sum is σ = 631670132. Its totient is φ = 631670130.
The previous prime is 631670093. The next prime is 631670159. The reversal of 631670131 is 131076136.
631670131 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an a-pointer prime, because the next prime (631670159) can be obtained adding 631670131 to its sum of digits (28).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 631670131 - 217 = 631539059 is a prime.
It is a super-2 number, since 2×6316701312 = 798014308795114322, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 631670131.
It is not a weakly prime, because it can be changed into another prime (631670161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315835065 + 315835066.
It is an arithmetic number, because the mean of its divisors is an integer number (315835066).
Almost surely, 2631670131 is an apocalyptic number.
631670131 is a deficient number, since it is larger than the sum of its proper divisors (1).
631670131 is an equidigital number, since it uses as much as digits as its factorization.
631670131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 28.
The square root of 631670131 is about 25133.0485814992. The cubic root of 631670131 is about 858.0187540162.
The spelling of 631670131 in words is "six hundred thirty-one million, six hundred seventy thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •