Search a number
-
+
100133002000309 is a prime number
BaseRepresentation
bin10110110001001000001000…
…000000111011011110110101
3111010112121210002001012011011
4112301020020000323132311
5101111034342003002214
6552544244401112221
730043241064403135
oct2661101000733665
9433477702035134
10100133002000309
11299a61931925a3
12b292543928671
1343b4669c52605
141aa266ac84ac5
15b89a50e6eac4
hex5b120803b7b5

100133002000309 has 2 divisors, whose sum is σ = 100133002000310. Its totient is φ = 100133002000308.

The previous prime is 100133002000271. The next prime is 100133002000313. The reversal of 100133002000309 is 903000200331001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 99194628122500 + 938373877809 = 9959650^2 + 968697^2 .

It is an emirp because it is prime and its reverse (903000200331001) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 100133002000309 - 27 = 100133002000181 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 100133002000309.

It is a congruent number.

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

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

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

Almost surely, 2100133002000309 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 22.

The spelling of 100133002000309 in words is "one hundred trillion, one hundred thirty-three billion, two million, three hundred nine", and thus it is an aban number.