Search a number
-
+
101132133312131 is a prime number
BaseRepresentation
bin10110111111101010101000…
…111000011010011010000011
3111021002010201020212200110222
4112333222220320122122003
5101223422102111442011
6555031243300413255
730205361353414445
oct2677525070323203
9437063636780428
10101132133312131
112a250995822179
12b4141029a722b
13445794726887c
141ad8b6dba2495
15ba5a2b2e1ddb
hex5bfaa8e1a683

101132133312131 has 2 divisors, whose sum is σ = 101132133312132. Its totient is φ = 101132133312130.

The previous prime is 101132133312073. The next prime is 101132133312139. The reversal of 101132133312131 is 131213331231101.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101132133312131 is a prime.

It is a super-2 number, since 2×1011321333121312 (a number of 29 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 101132133312131.

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

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

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

Almost surely, 2101132133312131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 972, while the sum is 26.

Adding to 101132133312131 its reverse (131213331231101), we get a palindrome (232345464543232).

The spelling of 101132133312131 in words is "one hundred one trillion, one hundred thirty-two billion, one hundred thirty-three million, three hundred twelve thousand, one hundred thirty-one".