Base | Representation |
---|---|
bin | 100100011101101000000… |
… | …1111110100101100000101 |
3 | 122202002100212112121101202 |
4 | 1020323100033310230011 |
5 | 1124101344433113122 |
6 | 14354114524232245 |
7 | 1025030541256034 |
oct | 110732017645405 |
9 | 18662325477352 |
10 | 5011425676037 |
11 | 1662374168030 |
12 | 68b2b839b685 |
13 | 2a4763250011 |
14 | 1347a8dc271b |
15 | 8a55a846e92 |
hex | 48ed03f4b05 |
5011425676037 has 8 divisors (see below), whose sum is σ = 5467366192800. Its totient is φ = 4555544553360.
The previous prime is 5011425676031. The next prime is 5011425676039. The reversal of 5011425676037 is 7306765241105.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5011425676037 - 26 = 5011425675973 is a prime.
It is a super-2 number, since 2×50114256760372 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5011425675982 and 5011425676000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5011425676031) 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, 14672003 + ... + 15009680.
It is an arithmetic number, because the mean of its divisors is an integer number (683420774100).
Almost surely, 25011425676037 is an apocalyptic number.
It is an amenable number.
5011425676037 is a deficient number, since it is larger than the sum of its proper divisors (455940516763).
5011425676037 is a wasteful number, since it uses less digits than its factorization.
5011425676037 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29697043.
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 5011425676037 in words is "five trillion, eleven billion, four hundred twenty-five million, six hundred seventy-six thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •