Search a number
-
+
56505624613 is a prime number
BaseRepresentation
bin110100100111111111…
…110110100000100101
312101211222022010212121
4310213333312200211
51411210414441423
641542555345541
74040155612234
oct644777664045
9171758263777
1056505624613
1121a66a52119
12ab4b7522b1
13543680ca49
142a4075ab1b
15170aaa745d
hexd27ff6825

56505624613 has 2 divisors, whose sum is σ = 56505624614. Its totient is φ = 56505624612.

The previous prime is 56505624589. The next prime is 56505624653. The reversal of 56505624613 is 31642650565.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 41476580964 + 15029043649 = 203658^2 + 122593^2 .

It is a cyclic number.

It is not a de Polignac number, because 56505624613 - 29 = 56505624101 is a prime.

It is a super-2 number, since 2×565056246132 (a number of 22 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 56505624613.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (56505624653) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28252812306 + 28252812307.

It is an arithmetic number, because the mean of its divisors is an integer number (28252812307).

Almost surely, 256505624613 is an apocalyptic number.

It is an amenable number.

56505624613 is a deficient number, since it is larger than the sum of its proper divisors (1).

56505624613 is an equidigital number, since it uses as much as digits as its factorization.

56505624613 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 648000, while the sum is 43.

The spelling of 56505624613 in words is "fifty-six billion, five hundred five million, six hundred twenty-four thousand, six hundred thirteen".