Search a number
-
+
4861111111113 = 31620370370371
BaseRepresentation
bin100011010111101000011…
…0011010000110111001001
3122012201101012011112120110
41012233100303100313021
51114121023421023423
614201055201344533
71011126602453625
oct106572063206711
918181335145513
104861111111113
111604649547674
12666148338149
1329352977348a
1412b3c994a185
15866ae32d193
hex46bd0cd0dc9

4861111111113 has 4 divisors (see below), whose sum is σ = 6481481481488. Its totient is φ = 3240740740740.

The previous prime is 4861111111111. The next prime is 4861111111151. The reversal of 4861111111113 is 3111111111684.

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 not a de Polignac number, because 4861111111113 - 21 = 4861111111111 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (4861111111111) 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, 810185185183 + ... + 810185185188.

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

Almost surely, 24861111111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1620370370374.

The product of its digits is 576, while the sum is 30.

Adding to 4861111111113 its reverse (3111111111684), we get a palindrome (7972222222797).

The spelling of 4861111111113 in words is "four trillion, eight hundred sixty-one billion, one hundred eleven million, one hundred eleven thousand, one hundred thirteen".

Divisors: 1 3 1620370370371 4861111111113