Base | Representation |
---|---|
bin | 100101001100000100001… |
… | …0111101111000101011101 |
3 | 200002121202221022111012110 |
4 | 1022120020113233011131 |
5 | 1132220114242202031 |
6 | 14512010335224233 |
7 | 1035161046053040 |
oct | 112301027570535 |
9 | 20077687274173 |
10 | 5111151522141 |
11 | 16a0699872265 |
12 | 6a66aa378079 |
13 | 2b0c97011002 |
14 | 13954987ac57 |
15 | 8ce4597ac46 |
hex | 4a6085ef15d |
5111151522141 has 16 divisors (see below), whose sum is σ = 7969547446784. Its totient is φ = 2852735732784.
The previous prime is 5111151522133. The next prime is 5111151522149. The reversal of 5111151522141 is 1412251511115.
It is an interprime number because it is at equal distance from previous prime (5111151522133) and next prime (5111151522149).
It is not a de Polignac number, because 5111151522141 - 23 = 5111151522133 is a prime.
It is a super-2 number, since 2×51111515221412 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111151522099 and 5111151522108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111151522149) 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, 2830094071 + ... + 2830095876.
It is an arithmetic number, because the mean of its divisors is an integer number (498096715424).
Almost surely, 25111151522141 is an apocalyptic number.
It is an amenable number.
5111151522141 is a deficient number, since it is larger than the sum of its proper divisors (2858395924643).
5111151522141 is a wasteful number, since it uses less digits than its factorization.
5111151522141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5660190000.
The product of its digits is 2000, while the sum is 30.
The spelling of 5111151522141 in words is "five trillion, one hundred eleven billion, one hundred fifty-one million, five hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •