Search a number
-
+
4891025101 is a prime number
BaseRepresentation
bin1001000111000011…
…10001111011001101
3110121212022211002211
410203201301323031
540004100300401
62125155350421
7232130012254
oct44341617315
913555284084
104891025101
11208a946606
12b45bb2411
135cc3c4cc1
1434581579b
151d95cc951
hex123871ecd

4891025101 has 2 divisors, whose sum is σ = 4891025102. Its totient is φ = 4891025100.

The previous prime is 4891025099. The next prime is 4891025119. The reversal of 4891025101 is 1015201984.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 3702844201 + 1188180900 = 60851^2 + 34470^2 .

It is a cyclic number.

It is not a de Polignac number, because 4891025101 - 21 = 4891025099 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 24891025101 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2880, while the sum is 31.

The square root of 4891025101 is about 69935.8641971342. The cubic root of 4891025101 is about 1697.4616212440.

The spelling of 4891025101 in words is "four billion, eight hundred ninety-one million, twenty-five thousand, one hundred one".