Base | Representation |
---|---|
bin | 1001011111001101… |
… | …11011110101111011 |
3 | 111010222200220221222 |
4 | 10233212323311323 |
5 | 40412441444120 |
6 | 2201235422255 |
7 | 240140522111 |
oct | 45746736573 |
9 | 14128626858 |
10 | 5093703035 |
11 | 2184298533 |
12 | ba1a5498b |
13 | 6323a9185 |
14 | 3646d3ab1 |
15 | 1ec2b5525 |
hex | 12f9bbd7b |
5093703035 has 8 divisors (see below), whose sum is σ = 6138020160. Its totient is φ = 4057911424.
The previous prime is 5093702953. The next prime is 5093703037. The reversal of 5093703035 is 5303073905.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5093703035 - 210 = 5093702011 is a prime.
It is a super-2 number, since 2×50937030352 = 51891621217536422450, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5093702986 and 5093703004.
It is not an unprimeable number, because it can be changed into a prime (5093703037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2130062 + ... + 2132451.
It is an arithmetic number, because the mean of its divisors is an integer number (767252520).
Almost surely, 25093703035 is an apocalyptic number.
5093703035 is a deficient number, since it is larger than the sum of its proper divisors (1044317125).
5093703035 is a wasteful number, since it uses less digits than its factorization.
5093703035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4262757.
The product of its (nonzero) digits is 42525, while the sum is 35.
The square root of 5093703035 is about 71370.1830949032. The cubic root of 5093703035 is about 1720.5918995642.
The spelling of 5093703035 in words is "five billion, ninety-three million, seven hundred three thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •