Base | Representation |
---|---|
bin | 1001010101011010… |
… | …00100110100110011 |
3 | 110221020212211221000 |
4 | 10222231010310303 |
5 | 40230411122421 |
6 | 2145140133043 |
7 | 235121265132 |
oct | 45255046463 |
9 | 13836784830 |
10 | 5011426611 |
11 | 2141901a94 |
12 | b7a397183 |
13 | 61b32c8b9 |
14 | 3577d7919 |
15 | 1e4e62226 |
hex | 12ab44d33 |
5011426611 has 16 divisors (see below), whose sum is σ = 7456765600. Its totient is φ = 3326357664.
The previous prime is 5011426601. The next prime is 5011426627. The reversal of 5011426611 is 1166241105.
5011426611 is a `hidden beast` number, since 5 + 0 + 1 + 1 + 42 + 6 + 611 = 666.
It is not a de Polignac number, because 5011426611 - 211 = 5011424563 is a prime.
It is a super-2 number, since 2×50114266112 = 50228793354877890642, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5011426601) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 399076 + ... + 411441.
It is an arithmetic number, because the mean of its divisors is an integer number (466047850).
Almost surely, 25011426611 is an apocalyptic number.
5011426611 is a deficient number, since it is larger than the sum of its proper divisors (2445338989).
5011426611 is a wasteful number, since it uses less digits than its factorization.
5011426611 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 810755 (or 810749 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 5011426611 is about 70791.4303500078. The cubic root of 5011426611 is about 1711.2775709669.
Adding to 5011426611 its reverse (1166241105), we get a palindrome (6177667716).
The spelling of 5011426611 in words is "five billion, eleven million, four hundred twenty-six thousand, six hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •