Search a number
-
+
601055105513 is a prime number
BaseRepresentation
bin10001011111100011010…
…11010001000111101001
32010110102120012222011012
420233301223101013221
534321430101334023
61140042040513305
761265464046252
oct10576153210751
92113376188135
10601055105513
112119a6a34a25
12985a417b835
13448aa41c8b5
142113c457b29
151097c7d6978
hex8bf1ad11e9

601055105513 has 2 divisors, whose sum is σ = 601055105514. Its totient is φ = 601055105512.

The previous prime is 601055105447. The next prime is 601055105527. The reversal of 601055105513 is 315501550106.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 431848751104 + 169206354409 = 657152^2 + 411347^2 .

It is a cyclic number.

It is not a de Polignac number, because 601055105513 - 232 = 596760138217 is a prime.

It is a super-2 number, since 2×6010551055132 (a number of 24 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 601055105513.

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

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

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

Almost surely, 2601055105513 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11250, while the sum is 32.

Adding to 601055105513 its reverse (315501550106), we get a palindrome (916556655619).

The spelling of 601055105513 in words is "six hundred one billion, fifty-five million, one hundred five thousand, five hundred thirteen".