Base | Representation |
---|---|
bin | 1001010101011010… |
… | …00100101111011001 |
3 | 110221020212211110012 |
4 | 10222231010233121 |
5 | 40230411120030 |
6 | 2145140131305 |
7 | 235121264126 |
oct | 45255045731 |
9 | 13836784405 |
10 | 5011426265 |
11 | 21419017aa |
12 | b7a396b35 |
13 | 61b32c6b1 |
14 | 3577d774d |
15 | 1e4e62095 |
hex | 12ab44bd9 |
5011426265 has 8 divisors (see below), whose sum is σ = 6066930888. Its totient is φ = 3973661440.
The previous prime is 5011426247. The next prime is 5011426291. The reversal of 5011426265 is 5626241105.
It can be written as a sum of positive squares in 4 ways, for example, as 308072704 + 4703353561 = 17552^2 + 68581^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5011426265 - 26 = 5011426201 is a prime.
It is a super-2 number, since 2×50114262652 = 50228786419063700450, which contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
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, 4434326 + ... + 4435455.
It is an arithmetic number, because the mean of its divisors is an integer number (758366361).
Almost surely, 25011426265 is an apocalyptic number.
It is an amenable number.
5011426265 is a deficient number, since it is larger than the sum of its proper divisors (1055504623).
5011426265 is a wasteful number, since it uses less digits than its factorization.
5011426265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8869899.
The product of its (nonzero) digits is 14400, while the sum is 32.
The square root of 5011426265 is about 70791.4279062091. The cubic root of 5011426265 is about 1711.2775315834.
The spelling of 5011426265 in words is "five billion, eleven million, four hundred twenty-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •