Base | Representation |
---|---|
bin | 11110101110000010001… |
… | …00010001101010001101 |
3 | 10201220110000222000121021 |
4 | 33113001010101222031 |
5 | 114243134031023432 |
6 | 2124520503034141 |
7 | 136154265624613 |
oct | 17270104215215 |
9 | 3656400860537 |
10 | 1055506111117 |
11 | 3777017567a7 |
12 | 150692a3b951 |
13 | 786c29ab983 |
14 | 391301416b3 |
15 | 1c6c96d6697 |
hex | f5c1111a8d |
1055506111117 has 4 divisors (see below), whose sum is σ = 1057815752956. Its totient is φ = 1053196469280.
The previous prime is 1055506111097. The next prime is 1055506111129. The reversal of 1055506111117 is 7111116055501.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 970991481321 + 84514629796 = 985389^2 + 290714^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1055506111117 is a prime.
It is a super-2 number, since 2×10555061111172 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055506111417) 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, 1154820234 + ... + 1154821147.
It is an arithmetic number, because the mean of its divisors is an integer number (264453938239).
Almost surely, 21055506111117 is an apocalyptic number.
It is an amenable number.
1055506111117 is a deficient number, since it is larger than the sum of its proper divisors (2309641839).
1055506111117 is an equidigital number, since it uses as much as digits as its factorization.
1055506111117 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2309641838.
The product of its (nonzero) digits is 5250, while the sum is 34.
The spelling of 1055506111117 in words is "one trillion, fifty-five billion, five hundred six million, one hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •