Search a number
-
+
101233312013 is a prime number
BaseRepresentation
bin101111001000111111…
…0011100000100001101
3100200022010100002021102
41132101332130010031
53124311211441023
6114301141112445
710212440645231
oct1362176340415
9320263302242
10101233312013
1139a29624729
12177529b8725
139714198572
144c84b825c1
152977655628
hex1791f9c10d

101233312013 has 2 divisors, whose sum is σ = 101233312014. Its totient is φ = 101233312012.

The previous prime is 101233312001. The next prime is 101233312039. The reversal of 101233312013 is 310213332101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 96489133129 + 4744178884 = 310627^2 + 68878^2 .

It is a cyclic number.

It is not a de Polignac number, because 101233312013 - 220 = 101232263437 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 2101233312013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101233312013 its reverse (310213332101), we get a palindrome (411446644114).

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