Base | Representation |
---|---|
bin | 100101101001110… |
… | …000110111010001 |
3 | 1122000122221102000 |
4 | 211221300313101 |
5 | 2243204030131 |
6 | 142403344213 |
7 | 21440255442 |
oct | 4551606721 |
9 | 1560587360 |
10 | 631705041 |
11 | 2a4643390 |
12 | 157682069 |
13 | a0b49986 |
14 | 5dc7b2c9 |
15 | 3a6d1ce6 |
hex | 25a70dd1 |
631705041 has 32 divisors (see below), whose sum is σ = 1022423040. Its totient is φ = 382294800.
The previous prime is 631705021. The next prime is 631705069. The reversal of 631705041 is 140507136.
631705041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 631705041 - 214 = 631688657 is a prime.
It is a Smith number, since the sum of its digits (27) coincides with the sum of the digits of its prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 631704996 and 631705014.
It is not an unprimeable number, because it can be changed into a prime (631705021) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 305176 + ... + 307238.
It is an arithmetic number, because the mean of its divisors is an integer number (31950720).
Almost surely, 2631705041 is an apocalyptic number.
It is an amenable number.
631705041 is a deficient number, since it is larger than the sum of its proper divisors (390717999).
631705041 is a wasteful number, since it uses less digits than its factorization.
631705041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3114 (or 3108 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
The square root of 631705041 is about 25133.7430757935. The cubic root of 631705041 is about 858.0345602002.
The spelling of 631705041 in words is "six hundred thirty-one million, seven hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •