Base | Representation |
---|---|
bin | 1001010101010100… |
… | …11011001111110011 |
3 | 110221012120120010101 |
4 | 10222222123033303 |
5 | 40230221411034 |
6 | 2145113213231 |
7 | 235112343106 |
oct | 45252331763 |
9 | 13835516111 |
10 | 5010732019 |
11 | 2141478147 |
12 | b7a101217 |
13 | 61b1486b7 |
14 | 35769673d |
15 | 1e4d76514 |
hex | 12aa9b3f3 |
5010732019 has 4 divisors (see below), whose sum is σ = 5029784496. Its totient is φ = 4991679544.
The previous prime is 5010731983. The next prime is 5010732043. The reversal of 5010732019 is 9102370105.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 9102370105 = 5 ⋅1820474021.
It is a cyclic number.
It is not a de Polignac number, because 5010732019 - 229 = 4473861107 is a prime.
It is a super-2 number, since 2×50107320192 = 50214870732463632722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5010732049) 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, 9525844 + ... + 9526369.
It is an arithmetic number, because the mean of its divisors is an integer number (1257446124).
Almost surely, 25010732019 is an apocalyptic number.
5010732019 is a deficient number, since it is larger than the sum of its proper divisors (19052477).
5010732019 is a wasteful number, since it uses less digits than its factorization.
5010732019 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19052476.
The product of its (nonzero) digits is 1890, while the sum is 28.
The square root of 5010732019 is about 70786.5242754580. The cubic root of 5010732019 is about 1711.1985053486.
The spelling of 5010732019 in words is "five billion, ten million, seven hundred thirty-two thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •