Base | Representation |
---|---|
bin | 10010010111110100011… |
… | …10001100100101100101 |
3 | 2020100101211011202011121 |
4 | 21023322032030211211 |
5 | 40320311343011124 |
6 | 1201555350133541 |
7 | 63415202045533 |
oct | 11137216144545 |
9 | 2210354152147 |
10 | 631263250789 |
11 | 223798714646 |
12 | a24149512b1 |
13 | 476b2961582 |
14 | 227a63a5153 |
15 | 116498282e4 |
hex | 92fa38c965 |
631263250789 has 2 divisors, whose sum is σ = 631263250790. Its totient is φ = 631263250788.
The previous prime is 631263250777. The next prime is 631263250841. The reversal of 631263250789 is 987052362136.
631263250789 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 (631263250841) can be obtained adding 631263250789 to its sum of digits (52).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 362846002689 + 268417248100 = 602367^2 + 518090^2 .
It is a cyclic number.
It is not a de Polignac number, because 631263250789 - 221 = 631261153637 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (631263250589) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315631625394 + 315631625395.
It is an arithmetic number, because the mean of its divisors is an integer number (315631625395).
Almost surely, 2631263250789 is an apocalyptic number.
It is an amenable number.
631263250789 is a deficient number, since it is larger than the sum of its proper divisors (1).
631263250789 is an equidigital number, since it uses as much as digits as its factorization.
631263250789 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3265920, while the sum is 52.
The spelling of 631263250789 in words is "six hundred thirty-one billion, two hundred sixty-three million, two hundred fifty thousand, seven hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •