Search a number
-
+
5093712947 = 15973189551
BaseRepresentation
bin1001011111001101…
…11110010000110011
3111010222201102120002
410233212332100303
540412442303242
62201235540215
7240140563031
oct45746762063
914128642502
105093712947
1121842a4a24
12ba1a5a66b
136323b083b
143646d7551
151ec2b8432
hex12f9be433

5093712947 has 4 divisors (see below), whose sum is σ = 5096904096. Its totient is φ = 5090521800.

The previous prime is 5093712893. The next prime is 5093712959. The reversal of 5093712947 is 7492173905.

5093712947 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 5093712947 - 28 = 5093712691 is a prime.

It is a Duffinian number.

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

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

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

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

Almost surely, 25093712947 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3191148.

The product of its (nonzero) digits is 476280, while the sum is 47.

The square root of 5093712947 is about 71370.2525356328. The cubic root of 5093712947 is about 1720.5930156151.

The spelling of 5093712947 in words is "five billion, ninety-three million, seven hundred twelve thousand, nine hundred forty-seven".

Divisors: 1 1597 3189551 5093712947