Base | Representation |
---|---|
bin | 11110100011111110010… |
… | …10100111110011000001 |
3 | 10201101111122210010010121 |
4 | 33101333022213303001 |
5 | 114201104002323410 |
6 | 2122224541300241 |
7 | 135603410366230 |
oct | 17217712476301 |
9 | 3641448703117 |
10 | 1050105511105 |
11 | 375390204002 |
12 | 14b626264681 |
13 | 78041b5b671 |
14 | 38b7aba0b17 |
15 | 1c4b04ed9da |
hex | f47f2a7cc1 |
1050105511105 has 8 divisors (see below), whose sum is σ = 1440144700992. Its totient is φ = 720072350448.
The previous prime is 1050105511069. The next prime is 1050105511139. The reversal of 1050105511105 is 5011155010501.
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 1050105511105 - 27 = 1050105510977 is a prime.
It is a super-2 number, since 2×10501055111052 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1050105511105.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15001507267 + ... + 15001507336.
It is an arithmetic number, because the mean of its divisors is an integer number (180018087624).
Almost surely, 21050105511105 is an apocalyptic number.
It is an amenable number.
1050105511105 is a deficient number, since it is larger than the sum of its proper divisors (390039189887).
1050105511105 is an equidigital number, since it uses as much as digits as its factorization.
1050105511105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30003014615.
The product of its (nonzero) digits is 625, while the sum is 25.
The spelling of 1050105511105 in words is "one trillion, fifty billion, one hundred five million, five hundred eleven thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •