Base | Representation |
---|---|
bin | 11110101110000010000… |
… | …00010000000100000101 |
3 | 10201220102221222102021001 |
4 | 33113001000100010011 |
5 | 114243133243243010 |
6 | 2124520424253301 |
7 | 136154253641521 |
oct | 17270100200405 |
9 | 3656387872231 |
10 | 1055505056005 |
11 | 3777010a6004 |
12 | 150692611231 |
13 | 786c26cc64a |
14 | 3912dd48d81 |
15 | 1c6c9578c3a |
hex | f5c1010105 |
1055505056005 has 4 divisors (see below), whose sum is σ = 1266606067212. Its totient is φ = 844404044800.
The previous prime is 1055505055999. The next prime is 1055505056029. The reversal of 1055505056005 is 5006505055501.
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 324464665924 + 731040390081 = 569618^2 + 855009^2 .
It is not a de Polignac number, because 1055505056005 - 27 = 1055505055877 is a prime.
It is a super-2 number, since 2×10555050560052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 105550505596 + ... + 105550505605.
It is an arithmetic number, because the mean of its divisors is an integer number (316651516803).
Almost surely, 21055505056005 is an apocalyptic number.
It is an amenable number.
1055505056005 is a deficient number, since it is larger than the sum of its proper divisors (211101011207).
1055505056005 is an equidigital number, since it uses as much as digits as its factorization.
1055505056005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 211101011206.
The product of its (nonzero) digits is 93750, while the sum is 37.
The spelling of 1055505056005 in words is "one trillion, fifty-five billion, five hundred five million, fifty-six thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •