Search a number
-
+
2001100101061 is a prime number
BaseRepresentation
bin11101000111101010110…
…111000101010111000101
321002022012002212202220211
4131013222313011113011
5230241223111213221
64131143115555421
7264401061131545
oct35075267052705
97068162782824
102001100101061
11701730925016
122839b045bb71
1311691a44c049
146cbd4a17325
15370be8836e1
hex1d1eadc55c5

2001100101061 has 2 divisors, whose sum is σ = 2001100101062. Its totient is φ = 2001100101060.

The previous prime is 2001100100983. The next prime is 2001100101073. The reversal of 2001100101061 is 1601010011002.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1659072802500 + 342027298561 = 1288050^2 + 584831^2 .

It is a cyclic number.

It is not a de Polignac number, because 2001100101061 - 215 = 2001100068293 is a prime.

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

It is a congruent number.

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

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

Almost surely, 22001100101061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 2001100101061 its reverse (1601010011002), we get a palindrome (3602110112063).

The spelling of 2001100101061 in words is "two trillion, one billion, one hundred million, one hundred one thousand, sixty-one".