Search a number
-
+
1013132070563 is a prime number
BaseRepresentation
bin11101011111000110110…
…00001000111010100011
310120212001220201201200212
432233203120020322203
5113044343302224223
62053232040204335
7133124233340024
oct16574330107243
93525056651625
101013132070563
11360737706978
12144427a696ab
13746cbb2c5b2
1437070550c4b
151b5495a5278
hexebe3608ea3

1013132070563 has 2 divisors, whose sum is σ = 1013132070564. Its totient is φ = 1013132070562.

The previous prime is 1013132070551. The next prime is 1013132070569. The reversal of 1013132070563 is 3650702313101.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1013132070563 is a prime.

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

It is a Sophie Germain prime.

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

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

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

Almost surely, 21013132070563 is an apocalyptic number.

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

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

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

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

Adding to 1013132070563 its reverse (3650702313101), we get a palindrome (4663834383664).

The spelling of 1013132070563 in words is "one trillion, thirteen billion, one hundred thirty-two million, seventy thousand, five hundred sixty-three".