Base | Representation |
---|---|
bin | 100100011010101000111… |
… | …1001111101111001001101 |
3 | 122201110210211021211210220 |
4 | 1020311101321331321031 |
5 | 1124000230312100221 |
6 | 14351134220421553 |
7 | 1024412560661421 |
oct | 110652171757115 |
9 | 18643724254726 |
10 | 5005011050061 |
11 | 165a682291650 |
12 | 68a0080a78b9 |
13 | 2a3c802c1649 |
14 | 13435b0c2b81 |
15 | 8a2d260c0c6 |
hex | 48d51e7de4d |
5005011050061 has 8 divisors (see below), whose sum is σ = 7280016072864. Its totient is φ = 3033340030320.
The previous prime is 5005011050059. The next prime is 5005011050159. The reversal of 5005011050061 is 1600501105005.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5005011050061 - 21 = 5005011050059 is a prime.
It is a super-2 number, since 2×50050110500612 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5005011050861) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 75833500726 + ... + 75833500791.
It is an arithmetic number, because the mean of its divisors is an integer number (910002009108).
Almost surely, 25005011050061 is an apocalyptic number.
It is an amenable number.
5005011050061 is a deficient number, since it is larger than the sum of its proper divisors (2275005022803).
5005011050061 is a wasteful number, since it uses less digits than its factorization.
5005011050061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 151667001531.
The product of its (nonzero) digits is 750, while the sum is 24.
Adding to 5005011050061 its reverse (1600501105005), we get a palindrome (6605512155066).
It can be divided in two parts, 50050 and 11050061, that added together give a palindrome (11100111).
The spelling of 5005011050061 in words is "five trillion, five billion, eleven million, fifty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •