Search a number
-
+
40151282513 is a prime number
BaseRepresentation
bin100101011001001100…
…111111001101010001
310211122012201111002112
4211121030333031101
51124212212020023
630240101155105
72620662161456
oct453114771521
9124565644075
1040151282513
1116034396911
1279466bba95
133a2b510144
141d2c70b82d
15109ee1b478
hex95933f351

40151282513 has 2 divisors, whose sum is σ = 40151282514. Its totient is φ = 40151282512.

The previous prime is 40151282503. The next prime is 40151282573. The reversal of 40151282513 is 31528215104.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 23040811264 + 17110471249 = 151792^2 + 130807^2 .

It is a cyclic number.

It is not a de Polignac number, because 40151282513 - 212 = 40151278417 is a prime.

It is a super-2 number, since 2×401512825132 (a number of 22 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 40151282513.

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

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

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

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

Almost surely, 240151282513 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 40151282513 its reverse (31528215104), we get a palindrome (71679497617).

The spelling of 40151282513 in words is "forty billion, one hundred fifty-one million, two hundred eighty-two thousand, five hundred thirteen".