Search a number
-
+
5101981 = 49110391
BaseRepresentation
bin10011011101100110011101
3100121012121021
4103131212131
52301230411
6301204141
761236403
oct23354635
910535537
105101981
112975215
121860651
131098331
1496b473
156aba71
hex4dd99d

5101981 has 4 divisors (see below), whose sum is σ = 5112864. Its totient is φ = 5091100.

The previous prime is 5101969. The next prime is 5101997. The reversal of 5101981 is 1891015.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 5101981 - 211 = 5099933 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (5101961) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4705 + ... + 5686.

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

Almost surely, 25101981 is an apocalyptic number.

It is an amenable number.

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

5101981 is a wasteful number, since it uses less digits than its factorization.

5101981 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 10882.

The product of its (nonzero) digits is 360, while the sum is 25.

The square root of 5101981 is about 2258.7565163160. The cubic root of 5101981 is about 172.1523460930.

Adding to 5101981 its reverse (1891015), we get a palindrome (6992996).

It can be divided in two parts, 5 and 101981, that multiplied together give a palindrome (509905).

The spelling of 5101981 in words is "five million, one hundred one thousand, nine hundred eighty-one".

Divisors: 1 491 10391 5101981