Base | Representation |
---|---|
bin | 100101101000000… |
… | …110101111111101 |
3 | 1121222211212012002 |
4 | 211220012233331 |
5 | 2243101123042 |
6 | 142350152045 |
7 | 21433465322 |
oct | 4550065775 |
9 | 1558755162 |
10 | 631270397 |
11 | 2a437687a |
12 | 1574b2625 |
13 | a0a26ba4 |
14 | 5dba6b49 |
15 | 3a648132 |
hex | 25a06bfd |
631270397 has 8 divisors (see below), whose sum is σ = 658972800. Its totient is φ = 603589360.
The previous prime is 631270379. The next prime is 631270411. The reversal of 631270397 is 793072136.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 631270397 - 28 = 631270141 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 631270397.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (631270337) 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 in 7 ways as a sum of consecutive naturals, for example, 96872 + ... + 103182.
It is an arithmetic number, because the mean of its divisors is an integer number (82371600).
Almost surely, 2631270397 is an apocalyptic number.
It is an amenable number.
631270397 is a deficient number, since it is larger than the sum of its proper divisors (27702403).
631270397 is a wasteful number, since it uses less digits than its factorization.
631270397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10683.
The product of its (nonzero) digits is 47628, while the sum is 38.
The square root of 631270397 is about 25125.0949649947. The cubic root of 631270397 is about 857.8377251187.
The spelling of 631270397 in words is "six hundred thirty-one million, two hundred seventy thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •