Base | Representation |
---|---|
bin | 100101100100010000011… |
… | …0001100011100111101101 |
3 | 200021120212100120121200211 |
4 | 1023020200301203213231 |
5 | 1134043012220123121 |
6 | 14551521243222421 |
7 | 1042010305401433 |
oct | 113104061434755 |
9 | 20246770517624 |
10 | 5163100551661 |
11 | 1710727729008 |
12 | 6b4787b17a11 |
13 | 2b5b557c0030 |
14 | 13bc76d98d53 |
15 | 8e4864b5ce1 |
hex | 4b220c639ed |
5163100551661 has 32 divisors (see below), whose sum is σ = 5780910733920. Its totient is φ = 4580098338816.
The previous prime is 5163100551629. The next prime is 5163100551689. The reversal of 5163100551661 is 1661550013615.
5163100551661 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 16 ways, for example, as 2576246494761 + 2586854056900 = 1605069^2 + 1608370^2 .
It is not a de Polignac number, because 5163100551661 - 25 = 5163100551629 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5163100551061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 40047675 + ... + 40176391.
It is an arithmetic number, because the mean of its divisors is an integer number (180653460435).
Almost surely, 25163100551661 is an apocalyptic number.
It is an amenable number.
5163100551661 is a deficient number, since it is larger than the sum of its proper divisors (617810182259).
5163100551661 is a wasteful number, since it uses less digits than its factorization.
5163100551661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 129793.
The product of its (nonzero) digits is 81000, while the sum is 40.
The spelling of 5163100551661 in words is "five trillion, one hundred sixty-three billion, one hundred million, five hundred fifty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •