Base | Representation |
---|---|
bin | 1001010110101010… |
… | …11011000100111001 |
3 | 110221222210012201010 |
4 | 10223111123010321 |
5 | 40241113103023 |
6 | 2150154544133 |
7 | 235310216442 |
oct | 45325330471 |
9 | 13858705633 |
10 | 5022003513 |
11 | 214787662a |
12 | b81a38049 |
13 | 620593c17 |
14 | 358d8c2c9 |
15 | 1e5d51093 |
hex | 12b55b139 |
5022003513 has 8 divisors (see below), whose sum is σ = 6724022400. Its totient is φ = 3333993488.
The previous prime is 5022003509. The next prime is 5022003521. The reversal of 5022003513 is 3153002205.
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 5022003513 - 22 = 5022003509 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5022003513.
It is not an unprimeable number, because it can be changed into a prime (5022003523) 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 7 ways as a sum of consecutive naturals, for example, 3501378 + ... + 3502811.
It is an arithmetic number, because the mean of its divisors is an integer number (840502800).
Almost surely, 25022003513 is an apocalyptic number.
It is an amenable number.
5022003513 is a deficient number, since it is larger than the sum of its proper divisors (1702018887).
5022003513 is a wasteful number, since it uses less digits than its factorization.
5022003513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7004431.
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 5022003513 is about 70866.0956522934. The cubic root of 5022003513 is about 1712.4806413213.
Adding to 5022003513 its reverse (3153002205), we get a palindrome (8175005718).
The spelling of 5022003513 in words is "five billion, twenty-two million, three thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •