Base | Representation |
---|---|
bin | 11110101110001101111… |
… | …01111010001110001101 |
3 | 10201220200221020110102201 |
4 | 33113012331322032031 |
5 | 114243334401334144 |
6 | 2124534400521501 |
7 | 136156610231251 |
oct | 17270675721615 |
9 | 3656627213381 |
10 | 1055605105549 |
11 | 377752620785 |
12 | 150700020291 |
13 | 7870a35c867 |
14 | 3913d350261 |
15 | 1c6d323d1d4 |
hex | f5c6f7a38d |
1055605105549 has 8 divisors (see below), whose sum is σ = 1106499284352. Its totient is φ = 1005908436960.
The previous prime is 1055605105523. The next prime is 1055605105567. The reversal of 1055605105549 is 9455015065501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055605105549 is a prime.
It is a super-2 number, since 2×10556051055492 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1055605105499 and 1055605105508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055605105579) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 299375749 + ... + 299379274.
It is an arithmetic number, because the mean of its divisors is an integer number (138312410544).
Almost surely, 21055605105549 is an apocalyptic number.
It is an amenable number.
1055605105549 is a deficient number, since it is larger than the sum of its proper divisors (50894178803).
1055605105549 is an equidigital number, since it uses as much as digits as its factorization.
1055605105549 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 598755107.
The product of its (nonzero) digits is 675000, while the sum is 46.
The spelling of 1055605105549 in words is "one trillion, fifty-five billion, six hundred five million, one hundred five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •