Search a number
-
+
101000010001001 is a prime number
BaseRepresentation
bin10110111101101111100101…
…101101111110101001101001
3111020121111200100120001120012
4112331233211231332221221
5101214241010030013001
6554450433011341305
730163003254663566
oct2675574555765151
9436544610501505
10101000010001001
112a1aa955642a61
12b3b258abb1835
13444834c503927
141ad25d86dd86d
15ba2396d5e2bb
hex5bdbe5b7ea69

101000010001001 has 2 divisors, whose sum is σ = 101000010001002. Its totient is φ = 101000010001000.

The previous prime is 101000010000983. The next prime is 101000010001027. The reversal of 101000010001001 is 100100010000101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 62249322750976 + 38750687250025 = 7889824^2 + 6225005^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 101000010001001 - 26 = 101000010000937 is a prime.

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

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

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

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

Almost surely, 2101000010001001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1, while the sum is 5.

Adding to 101000010001001 its reverse (100100010000101), we get a palindrome (201100020001102).

The spelling of 101000010001001 in words is "one hundred one trillion, ten million, one thousand, one".