Base | Representation |
---|---|
bin | 11110101110001000100… |
… | …00100010100111000111 |
3 | 10201220120202201111000110 |
4 | 33113010100202213013 |
5 | 114243241233023202 |
6 | 2124530054444103 |
7 | 136155516024015 |
oct | 17270420424707 |
9 | 3656522644013 |
10 | 1055559657927 |
11 | 3777299aa265 |
12 | 1506a8963633 |
13 | 78700b09588 |
14 | 391372bd8b5 |
15 | 1c6ce26226c |
hex | f5c44229c7 |
1055559657927 has 8 divisors (see below), whose sum is σ = 1407418049664. Its totient is φ = 703703852408.
The previous prime is 1055559657899. The next prime is 1055559657937. The reversal of 1055559657927 is 7297569555501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1055559657927 - 27 = 1055559657799 is a prime.
It is a super-3 number, since 3×10555596579273 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055559657937) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 716008 + ... + 1619810.
It is an arithmetic number, because the mean of its divisors is an integer number (175927256208).
Almost surely, 21055559657927 is an apocalyptic number.
1055559657927 is a deficient number, since it is larger than the sum of its proper divisors (351858391737).
1055559657927 is an equidigital number, since it uses as much as digits as its factorization.
1055559657927 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1293109.
The product of its (nonzero) digits is 148837500, while the sum is 66.
The spelling of 1055559657927 in words is "one trillion, fifty-five billion, five hundred fifty-nine million, six hundred fifty-seven thousand, nine hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •