Search a number
-
+
133110010100131 is a prime number
BaseRepresentation
bin11110010001000000010110…
…110111100011100110100011
3122110022012012110200200100221
4132101000112313203212203
5114421333300041201011
61151033521111423511
740015611065323501
oct3621002667434643
9573265173620327
10133110010100131
113945a702592429
1212b19741084b97
1359372b270a29c
1424c27b7747671
15105c76bc2c971
hex791016de39a3

133110010100131 has 2 divisors, whose sum is σ = 133110010100132. Its totient is φ = 133110010100130.

The previous prime is 133110010100129. The next prime is 133110010100161. The reversal of 133110010100131 is 131001010011331.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 133110010100131 - 21 = 133110010100129 is a prime.

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

Together with 133110010100129, it forms a pair of twin primes.

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

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

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

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

Almost surely, 2133110010100131 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 27, while the sum is 16.

Adding to 133110010100131 its reverse (131001010011331), we get a palindrome (264111020111462).

The spelling of 133110010100131 in words is "one hundred thirty-three trillion, one hundred ten billion, ten million, one hundred thousand, one hundred thirty-one".