Search a number
-
+
10536948557 is a prime number
BaseRepresentation
bin10011101000000110…
…10001001101001101
31000012100010110001222
421310003101031031
5133034424323212
64501323213125
7522054404432
oct116403211515
930170113058
1010536948557
114517918453
1220609771a5
13cbc00b205
1471d5b5b89
1541a0c3c72
hex2740d134d

10536948557 has 2 divisors, whose sum is σ = 10536948558. Its totient is φ = 10536948556.

The previous prime is 10536948533. The next prime is 10536948571. The reversal of 10536948557 is 75584963501.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 10443613636 + 93334921 = 102194^2 + 9661^2 .

It is a cyclic number.

It is not a de Polignac number, because 10536948557 - 26 = 10536948493 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 10536948499 and 10536948508.

It is a congruent number.

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

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

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

Almost surely, 210536948557 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4536000, while the sum is 53.

The spelling of 10536948557 in words is "ten billion, five hundred thirty-six million, nine hundred forty-eight thousand, five hundred fifty-seven".