Base | Representation |
---|---|
bin | 100101001100010001111… |
… | …1111111111110001001101 |
3 | 200002122222020112201001220 |
4 | 1022120203333333301031 |
5 | 1132222041423423234 |
6 | 14512124334353553 |
7 | 1035205405061346 |
oct | 112304377776115 |
9 | 20078866481056 |
10 | 5111615061069 |
11 | 16a0907495990 |
12 | 6a67b965b8b9 |
13 | 2b103c06b2ba |
14 | 1395912610cd |
15 | 8ce714e0a49 |
hex | 4a623fffc4d |
5111615061069 has 8 divisors (see below), whose sum is σ = 7435076452512. Its totient is φ = 3097948521840.
The previous prime is 5111615061031. The next prime is 5111615061073. The reversal of 5111615061069 is 9601605161115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5111615061069 - 215 = 5111615028301 is a prime.
It is a super-2 number, since 2×51116150610692 (a number of 26 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5111615061069.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5111615061769) 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, 77448713014 + ... + 77448713079.
It is an arithmetic number, because the mean of its divisors is an integer number (929384556564).
Almost surely, 25111615061069 is an apocalyptic number.
It is an amenable number.
5111615061069 is a deficient number, since it is larger than the sum of its proper divisors (2323461391443).
5111615061069 is a wasteful number, since it uses less digits than its factorization.
5111615061069 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 154897426107.
The product of its (nonzero) digits is 48600, while the sum is 42.
The spelling of 5111615061069 in words is "five trillion, one hundred eleven billion, six hundred fifteen million, sixty-one thousand, sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •