Base | Representation |
---|---|
bin | 1001010101010111… |
… | …00000000010101010 |
3 | 110221020002212122210 |
4 | 10222223200002222 |
5 | 40230304420202 |
6 | 2145123225550 |
7 | 235114625454 |
oct | 45253400252 |
9 | 13836085583 |
10 | 5011013802 |
11 | 214164a923 |
12 | b7a2182b6 |
13 | 61b216a32 |
14 | 35772b2d4 |
15 | 1e4dcec6c |
hex | 12aae00aa |
5011013802 has 8 divisors (see below), whose sum is σ = 10022027616. Its totient is φ = 1670337932.
The previous prime is 5011013771. The next prime is 5011013807. The reversal of 5011013802 is 2083101105.
It is a sphenic number, since it is the product of 3 distinct primes.
5011013802 is an admirable number.
It is a super-2 number, since 2×50110138022 = 50220518647668990408, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5011013807) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 417584478 + ... + 417584489.
It is an arithmetic number, because the mean of its divisors is an integer number (1252753452).
Almost surely, 25011013802 is an apocalyptic number.
5011013802 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.
5011013802 is a wasteful number, since it uses less digits than its factorization.
5011013802 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 835168972.
The product of its (nonzero) digits is 240, while the sum is 21.
The square root of 5011013802 is about 70788.5146192516. The cubic root of 5011013802 is about 1711.2305816738.
Adding to 5011013802 its reverse (2083101105), we get a palindrome (7094114907).
The spelling of 5011013802 in words is "five billion, eleven million, thirteen thousand, eight hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •