Base | Representation |
---|---|
bin | 101000110111011011111… |
… | …0001101011110111101111 |
3 | 201212221102220011112211221 |
4 | 1101232313301223313233 |
5 | 1214010302002324101 |
6 | 15540122152324211 |
7 | 1116533502062125 |
oct | 121566761536757 |
9 | 21787386145757 |
10 | 5616605511151 |
11 | 1875a97428398 |
12 | 7686519a3667 |
13 | 31984a082bcb |
14 | 155bb917b915 |
15 | 9b17a2e0aa1 |
hex | 51bb7c6bdef |
5616605511151 has 8 divisors (see below), whose sum is σ = 5622037416320. Its totient is φ = 5611173940512.
The previous prime is 5616605511107. The next prime is 5616605511157. The reversal of 5616605511151 is 1511155066165.
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 5616605511151 - 215 = 5616605478383 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5616605511098 and 5616605511107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5616605511157) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 45331081 + ... + 45454813.
It is an arithmetic number, because the mean of its divisors is an integer number (702754677040).
Almost surely, 25616605511151 is an apocalyptic number.
5616605511151 is a deficient number, since it is larger than the sum of its proper divisors (5431905169).
5616605511151 is a wasteful number, since it uses less digits than its factorization.
5616605511151 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 167265.
The product of its (nonzero) digits is 135000, while the sum is 43.
The spelling of 5616605511151 in words is "five trillion, six hundred sixteen billion, six hundred five million, five hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •