Base | Representation |
---|---|
bin | 11001110000001100001011… |
… | …11001000100100010110111 |
3 | 21102111220111221121121110011 |
4 | 30320012011321010202313 |
5 | 24410322041333101221 |
6 | 320240033530041051 |
7 | 14633324432445355 |
oct | 1470060571044267 |
9 | 242456457547404 |
10 | 56631390128311 |
11 | 17054268394039 |
12 | 6427661b79187 |
13 | 257a417aa879b |
14 | ddad8c5887d5 |
15 | 6831a46341e1 |
hex | 338185e448b7 |
56631390128311 has 2 divisors, whose sum is σ = 56631390128312. Its totient is φ = 56631390128310.
The previous prime is 56631390128251. The next prime is 56631390128317. The reversal of 56631390128311 is 11382109313665.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56631390128311 - 213 = 56631390120119 is a prime.
It is a super-2 number, since 2×566313901283112 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56631390128317) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28315695064155 + 28315695064156.
It is an arithmetic number, because the mean of its divisors is an integer number (28315695064156).
Almost surely, 256631390128311 is an apocalyptic number.
56631390128311 is a deficient number, since it is larger than the sum of its proper divisors (1).
56631390128311 is an equidigital number, since it uses as much as digits as its factorization.
56631390128311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 699840, while the sum is 49.
The spelling of 56631390128311 in words is "fifty-six trillion, six hundred thirty-one billion, three hundred ninety million, one hundred twenty-eight thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •