Base | Representation |
---|---|
bin | 11001011101111110100101… |
… | …00011001010100000111101 |
3 | 21100022002021022210110021121 |
4 | 30232333102203022200331 |
5 | 24320043442404143023 |
6 | 315040342243430541 |
7 | 14540162151615364 |
oct | 1456772243124075 |
9 | 240262238713247 |
10 | 56005611006013 |
11 | 16932934393399 |
12 | 6346319985451 |
13 | 25333ca391976 |
14 | db89866a87db |
15 | 671c7b4e2d5d |
hex | 32efd28ca83d |
56005611006013 has 2 divisors, whose sum is σ = 56005611006014. Its totient is φ = 56005611006012.
The previous prime is 56005611005987. The next prime is 56005611006041. The reversal of 56005611006013 is 31060011650065.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49019643968409 + 6985967037604 = 7001403^2 + 2643098^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-56005611006013 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56005611006013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (56005611006043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28002805503006 + 28002805503007.
It is an arithmetic number, because the mean of its divisors is an integer number (28002805503007).
Almost surely, 256005611006013 is an apocalyptic number.
It is an amenable number.
56005611006013 is a deficient number, since it is larger than the sum of its proper divisors (1).
56005611006013 is an equidigital number, since it uses as much as digits as its factorization.
56005611006013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16200, while the sum is 34.
Adding to 56005611006013 its reverse (31060011650065), we get a palindrome (87065622656078).
The spelling of 56005611006013 in words is "fifty-six trillion, five billion, six hundred eleven million, six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •