Base | Representation |
---|---|
bin | 101000000110000110101… |
… | …0100110111100100010101 |
3 | 201111210222211110000201210 |
4 | 1100030031110313210111 |
5 | 1210241321123140221 |
6 | 15415322034212033 |
7 | 1106063312240556 |
oct | 120141524674425 |
9 | 21453884400653 |
10 | 5510666615061 |
11 | 1835073706803 |
12 | 750007124019 |
13 | 30c86604cc8a |
14 | 150a0949632d |
15 | 985299dd276 |
hex | 5030d537915 |
5510666615061 has 8 divisors (see below), whose sum is σ = 7391552825664. Its totient is φ = 3651779073920.
The previous prime is 5510666615033. The next prime is 5510666615197. The reversal of 5510666615061 is 1605166660155.
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 5510666615061 - 217 = 5510666483989 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5510666615061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5510666615011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5499666780 + ... + 5499667781.
It is an arithmetic number, because the mean of its divisors is an integer number (923944103208).
Almost surely, 25510666615061 is an apocalyptic number.
It is an amenable number.
5510666615061 is a deficient number, since it is larger than the sum of its proper divisors (1880886210603).
5510666615061 is a wasteful number, since it uses less digits than its factorization.
5510666615061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10999334731.
The product of its (nonzero) digits is 972000, while the sum is 48.
The spelling of 5510666615061 in words is "five trillion, five hundred ten billion, six hundred sixty-six million, six hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •