Search a number
-
+
101024981 is a prime number
BaseRepresentation
bin1100000010110…
…00010011010101
321001002121012222
412001120103111
5201330244411
614005152125
72334461321
oct601302325
9231077188
10101024981
1152031622
12299bb645
1317c121c5
14d5ba981
158d084db
hex60584d5

101024981 has 2 divisors, whose sum is σ = 101024982. Its totient is φ = 101024980.

The previous prime is 101024971. The next prime is 101024983. The reversal of 101024981 is 189420101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 76720081 + 24304900 = 8759^2 + 4930^2 .

It is a cyclic number.

It is not a de Polignac number, because 101024981 - 226 = 33916117 is a prime.

It is a super-2 number, since 2×1010249812 = 20412093572100722, which contains 22 as substring.

Together with 101024983, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2101024981 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 101024981 is about 10051.1183954822. The cubic root of 101024981 is about 465.7393425838.

The spelling of 101024981 in words is "one hundred one million, twenty-four thousand, nine hundred eighty-one".