Base | Representation |
---|---|
bin | 101000111110001101011… |
… | …0000110001001010010101 |
3 | 201221022222121021212212121 |
4 | 1101330122300301022111 |
5 | 1214230044141220244 |
6 | 15550525355215541 |
7 | 1120560113511121 |
oct | 121743260611225 |
9 | 21838877255777 |
10 | 5631151116949 |
11 | 1881181002306 |
12 | 76b4311475b1 |
13 | 31b027724147 |
14 | 156798cbc581 |
15 | 9b72c299c84 |
hex | 51f1ac31295 |
5631151116949 has 2 divisors, whose sum is σ = 5631151116950. Its totient is φ = 5631151116948.
The previous prime is 5631151116931. The next prime is 5631151117037. The reversal of 5631151116949 is 9496111511365.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5248763476324 + 382387640625 = 2291018^2 + 618375^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5631151116949 is a prime.
It is a super-3 number, since 3×56311511169493 (a number of 39 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5631151116896 and 5631151116905.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5631151116449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2815575558474 + 2815575558475.
It is an arithmetic number, because the mean of its divisors is an integer number (2815575558475).
Almost surely, 25631151116949 is an apocalyptic number.
It is an amenable number.
5631151116949 is a deficient number, since it is larger than the sum of its proper divisors (1).
5631151116949 is an equidigital number, since it uses as much as digits as its factorization.
5631151116949 is an evil number, because the sum of its binary digits is even.
The product of its digits is 874800, while the sum is 52.
The spelling of 5631151116949 in words is "five trillion, six hundred thirty-one billion, one hundred fifty-one million, one hundred sixteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •