Base | Representation |
---|---|
bin | 101100011011010110011… |
… | …1110010101101100100001 |
3 | 210121201210011100201011011 |
4 | 1120312230332111230201 |
5 | 1300020142420104221 |
6 | 20553025250220521 |
7 | 1200101424214603 |
oct | 130665476255441 |
9 | 23551704321134 |
10 | 6106050550561 |
11 | 1a4461a395765 |
12 | 827487b84741 |
13 | 353a4b557170 |
14 | 17176a65b173 |
15 | a8c744931e1 |
hex | 58dacf95b21 |
6106050550561 has 4 divisors (see below), whose sum is σ = 6575746746772. Its totient is φ = 5636354354352.
The previous prime is 6106050550543. The next prime is 6106050550591. The reversal of 6106050550561 is 1650550506016.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3277747307025 + 2828303243536 = 1810455^2 + 1681756^2 .
It is a cyclic number.
It is not a de Polignac number, because 6106050550561 - 27 = 6106050550433 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (6106050550541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 234848098086 + ... + 234848098111.
It is an arithmetic number, because the mean of its divisors is an integer number (1643936686693).
Almost surely, 26106050550561 is an apocalyptic number.
It is an amenable number.
6106050550561 is a deficient number, since it is larger than the sum of its proper divisors (469696196211).
6106050550561 is a wasteful number, since it uses less digits than its factorization.
6106050550561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 469696196210.
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 6106050550561 in words is "six trillion, one hundred six billion, fifty million, five hundred fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •