Base | Representation |
---|---|
bin | 101000111110010101100… |
… | …0110100001110010110111 |
3 | 201221100200201010121211011 |
4 | 1101330223012201302313 |
5 | 1214231124331203011 |
6 | 15551012511053051 |
7 | 1120566652613146 |
oct | 121745306416267 |
9 | 21840621117734 |
10 | 5631425256631 |
11 | 1881301823529 |
12 | 76b4a8b11187 |
13 | 31b06c469285 |
14 | 1567c347d75d |
15 | 9b74639b621 |
hex | 51f2b1a1cb7 |
5631425256631 has 8 divisors (see below), whose sum is σ = 5637802635920. Its totient is φ = 5625048250368.
The previous prime is 5631425256629. The next prime is 5631425256643. The reversal of 5631425256631 is 1366525241365.
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 5631425256631 - 21 = 5631425256629 is a prime.
It is a super-2 number, since 2×56314252566312 (a number of 26 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 (5631425256931) 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, 39634825 + ... + 39776653.
It is an arithmetic number, because the mean of its divisors is an integer number (704725329490).
Almost surely, 25631425256631 is an apocalyptic number.
5631425256631 is a deficient number, since it is larger than the sum of its proper divisors (6377379289).
5631425256631 is a wasteful number, since it uses less digits than its factorization.
5631425256631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186513.
The product of its digits is 3888000, while the sum is 49.
The spelling of 5631425256631 in words is "five trillion, six hundred thirty-one billion, four hundred twenty-five million, two hundred fifty-six thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •