Base | Representation |
---|---|
bin | 11110101101001100100… |
… | …00100001100100010111 |
3 | 10201212021200122010202010 |
4 | 33112212100201210113 |
5 | 114241223410242200 |
6 | 2124404114515303 |
7 | 136140164616411 |
oct | 17264620414427 |
9 | 3655250563663 |
10 | 1055056337175 |
11 | 3774a08849a5 |
12 | 150588295b33 |
13 | 78650760b49 |
14 | 390ca5019b1 |
15 | 1c69ee90150 |
hex | f5a6421917 |
1055056337175 has 24 divisors (see below), whose sum is σ = 1744408506960. Its totient is φ = 562681004800.
The previous prime is 1055056337171. The next prime is 1055056337213. The reversal of 1055056337175 is 5717336505501.
It is not a de Polignac number, because 1055056337175 - 22 = 1055056337171 is a prime.
It is a super-2 number, since 2×10550563371752 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1055056337171) 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 23 ways as a sum of consecutive naturals, for example, 2813755 + ... + 3166595.
It is an arithmetic number, because the mean of its divisors is an integer number (72683687790).
Almost surely, 21055056337175 is an apocalyptic number.
1055056337175 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1055056337175 is a deficient number, since it is larger than the sum of its proper divisors (689352169785).
1055056337175 is a wasteful number, since it uses less digits than its factorization.
1055056337175 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 392723 (or 392718 counting only the distinct ones).
The product of its (nonzero) digits is 1653750, while the sum is 48.
The spelling of 1055056337175 in words is "one trillion, fifty-five billion, fifty-six million, three hundred thirty-seven thousand, one hundred seventy-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •