Base | Representation |
---|---|
bin | 10010010111010110110… |
… | …00100110100111110111 |
3 | 2020022202110202210012010 |
4 | 21023223120212213313 |
5 | 40314304131230011 |
6 | 1201514534455303 |
7 | 63406060140612 |
oct | 11135330464767 |
9 | 2208673683163 |
10 | 631014320631 |
11 | 223680151742 |
12 | a2365504533 |
13 | 47673204b16 |
14 | 227812c7179 |
15 | 11632a561a6 |
hex | 92eb6269f7 |
631014320631 has 8 divisors (see below), whose sum is σ = 841400897920. Its totient is φ = 420651978552.
The previous prime is 631014320591. The next prime is 631014320639. The reversal of 631014320631 is 136023410136.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 631014320631 - 233 = 622424386039 is a prime.
It is a super-2 number, since 2×6310143206312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (631014320639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5997961 + ... + 6102258.
It is an arithmetic number, because the mean of its divisors is an integer number (105175112240).
Almost surely, 2631014320631 is an apocalyptic number.
631014320631 is a deficient number, since it is larger than the sum of its proper divisors (210386577289).
631014320631 is a wasteful number, since it uses less digits than its factorization.
631014320631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12117605.
The product of its (nonzero) digits is 7776, while the sum is 30.
Adding to 631014320631 its reverse (136023410136), we get a palindrome (767037730767).
The spelling of 631014320631 in words is "six hundred thirty-one billion, fourteen million, three hundred twenty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •