Search a number
-
+
4013131101131 is a prime number
BaseRepresentation
bin111010011001100001010…
…000001111001111001011
3112012122121000011202100002
4322121201100033033023
51011222343030214011
612311335035033215
7562640062345565
oct72314120171713
915178530152302
104013131101131
111307a60980269
1254993159b80b
1323158a3b0169
14dc345274335
156e5cdba6c3b
hex3a66140f3cb

4013131101131 has 2 divisors, whose sum is σ = 4013131101132. Its totient is φ = 4013131101130.

The previous prime is 4013131101113. The next prime is 4013131101139. The reversal of 4013131101131 is 1311011313104.

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

Together with previous prime (4013131101113) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 4013131101131 - 218 = 4013130838987 is a prime.

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

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

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

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

Almost surely, 24013131101131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 108, while the sum is 20.

Adding to 4013131101131 its reverse (1311011313104), we get a palindrome (5324142414235).

The spelling of 4013131101131 in words is "four trillion, thirteen billion, one hundred thirty-one million, one hundred one thousand, one hundred thirty-one".