Base | Representation |
---|---|
bin | 1001100110000110001110… |
… | …1001111001000101011111 |
3 | 1101100120200102021021002111 |
4 | 2121201203221321011133 |
5 | 2340323112032330322 |
6 | 34234353201534451 |
7 | 2136135413004655 |
oct | 231414351710537 |
9 | 41316612237074 |
10 | 10550111605087 |
11 | 33a8305a6207a |
12 | 1224823044427 |
13 | 5b6b431c0b12 |
14 | 2868b1814dd5 |
15 | 134675114177 |
hex | 99863a7915f |
10550111605087 has 8 divisors (see below), whose sum is σ = 11008851683040. Its totient is φ = 10091374824960.
The previous prime is 10550111605057. The next prime is 10550111605109. The reversal of 10550111605087 is 78050611105501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10550111605087 is a prime.
It is a super-2 number, since 2×105501116050872 (a number of 27 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 (10550111605027) by changing a digit.
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, 7502287 + ... + 8796847.
It is an arithmetic number, because the mean of its divisors is an integer number (1376106460380).
Almost surely, 210550111605087 is an apocalyptic number.
10550111605087 is a deficient number, since it is larger than the sum of its proper divisors (458740077953).
10550111605087 is a wasteful number, since it uses less digits than its factorization.
10550111605087 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1648913.
The product of its (nonzero) digits is 42000, while the sum is 40.
The spelling of 10550111605087 in words is "ten trillion, five hundred fifty billion, one hundred eleven million, six hundred five thousand, eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •