Search a number
-
+
133030530331 is a prime number
BaseRepresentation
bin111101111100100111…
…1001100110100011011
3110201101010102010200221
41323321033030310123
54134421303432311
6141040253540511
712416422564516
oct1737117146433
9421333363627
10133030530331
11514662a2456
12219477a4737
13c7109b854a
14661db7bd7d
1536d8e38671
hex1ef93ccd1b

133030530331 has 2 divisors, whose sum is σ = 133030530332. Its totient is φ = 133030530330.

The previous prime is 133030530313. The next prime is 133030530377. The reversal of 133030530331 is 133035030331.

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

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 133030530331 - 223 = 133022141723 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 133030530296 and 133030530305.

It is not a weakly prime, because it can be changed into another prime (133030530431) 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, 66515265165 + 66515265166.

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

Almost surely, 2133030530331 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 3645, while the sum is 25.

Adding to 133030530331 its reverse (133035030331), we get a palindrome (266065560662).

The spelling of 133030530331 in words is "one hundred thirty-three billion, thirty million, five hundred thirty thousand, three hundred thirty-one".