Search a number
-
+
2013553215367 is a prime number
BaseRepresentation
bin11101010011010001000…
…111111100011110000111
321010111022222121112020121
4131103101013330132013
5230442224110342432
64141002533242411
7265321503635341
oct35232107743607
97114288545217
102013553215367
11706a4132a121
122862a6a93407
13117b53430c35
146d6568a4291
153759ccaa197
hex1d4d11fc787

2013553215367 has 2 divisors, whose sum is σ = 2013553215368. Its totient is φ = 2013553215366.

The previous prime is 2013553215301. The next prime is 2013553215383. The reversal of 2013553215367 is 7635123553102.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 2013553215367 - 223 = 2013544826759 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

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

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

Almost surely, 22013553215367 is an apocalyptic number.

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

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

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

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

Adding to 2013553215367 its reverse (7635123553102), we get a palindrome (9648676768469).

The spelling of 2013553215367 in words is "two trillion, thirteen billion, five hundred fifty-three million, two hundred fifteen thousand, three hundred sixty-seven".