Search a number
-
+
12633647581 is a prime number
BaseRepresentation
bin10111100010000011…
…00010100111011101
31012121110102210102101
423301001202213131
5201333203210311
65445342525101
7625034142532
oct136101424735
935543383371
1012633647581
1153a3401465
122546b96791
131264511719
1487bc42d89
154de1d7ec1
hex2f10629dd

12633647581 has 2 divisors, whose sum is σ = 12633647582. Its totient is φ = 12633647580.

The previous prime is 12633647573. The next prime is 12633647617. The reversal of 12633647581 is 18574633621.

12633647581 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 12367664100 + 265983481 = 111210^2 + 16309^2 .

It is a cyclic number.

It is not a de Polignac number, because 12633647581 - 23 = 12633647573 is a prime.

It is a super-3 number, since 3×126336475813 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

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

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

Almost surely, 212633647581 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 725760, while the sum is 46.

The spelling of 12633647581 in words is "twelve billion, six hundred thirty-three million, six hundred forty-seven thousand, five hundred eighty-one".