Search a number
-
+
30312033101333 is a prime number
BaseRepresentation
bin1101110010001100100011…
…11101110010011000010101
310222022210122201000200001222
412321012101331302120111
512433113020433220313
6144245053351300125
76245654303111624
oct671062175623025
9128283581020058
1030312033101333
1197272964a84a5
12349681267a645
1313bb549222159
1476b1786856bb
15378743a96208
hex1b9191f72615

30312033101333 has 2 divisors, whose sum is σ = 30312033101334. Its totient is φ = 30312033101332.

The previous prime is 30312033101323. The next prime is 30312033101507. The reversal of 30312033101333 is 33310133021303.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 24814963657444 + 5497069443889 = 4981462^2 + 2344583^2 .

It is a cyclic number.

It is not a de Polignac number, because 30312033101333 - 210 = 30312033100309 is a prime.

It is a congruent number.

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

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

Almost surely, 230312033101333 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 30312033101333 its reverse (33310133021303), we get a palindrome (63622166122636).

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