Base | Representation |
---|---|
bin | 11110101111000011101… |
… | …00001111011111010111 |
3 | 10201221212022211201100210 |
4 | 33113201310033133113 |
5 | 114300300210243210 |
6 | 2125051211340503 |
7 | 136204020055113 |
oct | 17274164173727 |
9 | 3657768751323 |
10 | 1056055556055 |
11 | 377963914925 |
12 | 150806a51733 |
13 | 7877c786616 |
14 | 391830c8743 |
15 | 1c70ca69e20 |
hex | f5e1d0f7d7 |
1056055556055 has 8 divisors (see below), whose sum is σ = 1689688889712. Its totient is φ = 563229629888.
The previous prime is 1056055556027. The next prime is 1056055556089. The reversal of 1056055556055 is 5506555506501.
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 1056055556055 - 26 = 1056055555991 is a prime.
It is a super-3 number, since 3×10560555560553 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 1056055555995 and 1056055556013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 35201851854 + ... + 35201851883.
It is an arithmetic number, because the mean of its divisors is an integer number (211211111214).
Almost surely, 21056055556055 is an apocalyptic number.
1056055556055 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1056055556055 is a deficient number, since it is larger than the sum of its proper divisors (633633333657).
1056055556055 is an equidigital number, since it uses as much as digits as its factorization.
1056055556055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70403703745.
The product of its (nonzero) digits is 2812500, while the sum is 48.
The spelling of 1056055556055 in words is "one trillion, fifty-six billion, fifty-five million, five hundred fifty-six thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •