Base | Representation |
---|---|
bin | 1001010101011011… |
… | …11011110010010110 |
3 | 110221021022021201220 |
4 | 10222231323302112 |
5 | 40230440323414 |
6 | 2145145031210 |
7 | 235123223355 |
oct | 45255736226 |
9 | 13837267656 |
10 | 5011651734 |
11 | 2141a46141 |
12 | b7a485506 |
13 | 61b3ab1cb |
14 | 35785599c |
15 | 1e4ea8ca9 |
hex | 12ab7bc96 |
5011651734 has 8 divisors (see below), whose sum is σ = 10023303480. Its totient is φ = 1670550576.
The previous prime is 5011651727. The next prime is 5011651741. The reversal of 5011651734 is 4371561105.
It is an interprime number because it is at equal distance from previous prime (5011651727) and next prime (5011651741).
It is a sphenic number, since it is the product of 3 distinct primes.
5011651734 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 5011651695 and 5011651704.
It is a congruent number.
It is an unprimeable number.
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, 417637639 + ... + 417637650.
It is an arithmetic number, because the mean of its divisors is an integer number (1252912935).
Almost surely, 25011651734 is an apocalyptic number.
5011651734 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5011651734 is a wasteful number, since it uses less digits than its factorization.
5011651734 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835275294.
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 5011651734 is about 70793.0203763055. The cubic root of 5011651734 is about 1711.3031952186.
The spelling of 5011651734 in words is "five billion, eleven million, six hundred fifty-one thousand, seven hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •