Base | Representation |
---|---|
bin | 1001010111000001… |
… | …10111001110011001 |
3 | 110222012102120101202 |
4 | 10223200313032121 |
5 | 40242400034033 |
6 | 2150343123545 |
7 | 235344546515 |
oct | 45340671631 |
9 | 13865376352 |
10 | 5025002393 |
11 | 2149534744 |
12 | b82a435b5 |
13 | 6210a3bc8 |
14 | 35952d145 |
15 | 1e62448e8 |
hex | 12b837399 |
5025002393 has 4 divisors (see below), whose sum is σ = 5073788928. Its totient is φ = 4976215860.
The previous prime is 5025002309. The next prime is 5025002401. The reversal of 5025002393 is 3932005205.
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 5025002393 - 214 = 5024986009 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5025002693) 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 in 3 ways as a sum of consecutive naturals, for example, 24393113 + ... + 24393318.
It is an arithmetic number, because the mean of its divisors is an integer number (1268447232).
Almost surely, 25025002393 is an apocalyptic number.
It is an amenable number.
5025002393 is a deficient number, since it is larger than the sum of its proper divisors (48786535).
5025002393 is a wasteful number, since it uses less digits than its factorization.
5025002393 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48786534.
The product of its (nonzero) digits is 8100, while the sum is 29.
The square root of 5025002393 is about 70887.2512727077. The cubic root of 5025002393 is about 1712.8214416976.
Adding to 5025002393 its reverse (3932005205), we get a palindrome (8957007598).
The spelling of 5025002393 in words is "five billion, twenty-five million, two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.858 sec. • engine limits •