Base | Representation |
---|---|
bin | 11000000000110000111000… |
… | …101000011100011110100111 |
3 | 111211220210112020222001020011 |
4 | 120000300320220130132213 |
5 | 102320220240114004201 |
6 | 1012334313505351051 |
7 | 31146516236030356 |
oct | 3000607050343647 |
9 | 454823466861204 |
10 | 105605606000551 |
11 | 307160a4500438 |
12 | ba170a7938487 |
13 | 46c07484131a7 |
14 | 1c114a51a999d |
15 | c3209e0bb151 |
hex | 600c38a1c7a7 |
105605606000551 has 4 divisors (see below), whose sum is σ = 105745111425352. Its totient is φ = 105466100575752.
The previous prime is 105605606000513. The next prime is 105605606000603. The reversal of 105605606000551 is 155000606506501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105605606000551 - 221 = 105605603903399 is a prime.
It is a super-3 number, since 3×1056056060005513 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105605606000351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 69752711265 + ... + 69752712778.
It is an arithmetic number, because the mean of its divisors is an integer number (26436277856338).
Almost surely, 2105605606000551 is an apocalyptic number.
105605606000551 is a deficient number, since it is larger than the sum of its proper divisors (139505424801).
105605606000551 is an equidigital number, since it uses as much as digits as its factorization.
105605606000551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 139505424800.
The product of its (nonzero) digits is 135000, while the sum is 40.
The spelling of 105605606000551 in words is "one hundred five trillion, six hundred five billion, six hundred six million, five hundred fifty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.295 sec. • engine limits •