Base | Representation |
---|---|
bin | 11110101110001000000… |
… | …11000000011011100001 |
3 | 10201220120112001020020120 |
4 | 33113010003000123201 |
5 | 114243234331010144 |
6 | 2124525450430453 |
7 | 136155443616240 |
oct | 17270403003341 |
9 | 3656515036216 |
10 | 1055556110049 |
11 | 3777279a6731 |
12 | 1506a7732429 |
13 | 7870016673c |
14 | 39136a38957 |
15 | 1c6cdcb0e19 |
hex | f5c40c06e1 |
1055556110049 has 8 divisors (see below), whose sum is σ = 1608466453440. Its totient is φ = 603174920016.
The previous prime is 1055556110047. The next prime is 1055556110087. The reversal of 1055556110049 is 9400116555501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1055556110049 - 21 = 1055556110047 is a prime.
It is a super-2 number, since 2×10555561100492 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1055556110047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 25132288314 + ... + 25132288355.
It is an arithmetic number, because the mean of its divisors is an integer number (201058306680).
Almost surely, 21055556110049 is an apocalyptic number.
It is an amenable number.
1055556110049 is a deficient number, since it is larger than the sum of its proper divisors (552910343391).
1055556110049 is an equidigital number, since it uses as much as digits as its factorization.
1055556110049 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50264576679.
The product of its (nonzero) digits is 135000, while the sum is 42.
The spelling of 1055556110049 in words is "one trillion, fifty-five billion, five hundred fifty-six million, one hundred ten thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •