Base | Representation |
---|---|
bin | 10111111000000010100011… |
… | …010100011100111000101011 |
3 | 111202210111002200121011110202 |
4 | 113320002203110130320223 |
5 | 102230404443212000021 |
6 | 1011155045302102415 |
7 | 31055304026246624 |
oct | 2770024324347053 |
9 | 452714080534422 |
10 | 105006100500011 |
11 | 30504923257687 |
12 | b93aa7671aa0b |
13 | 4679057063219 |
14 | 1bd0472888a4b |
15 | c216b287ba0b |
hex | 5f80a351ce2b |
105006100500011 has 4 divisors (see below), whose sum is σ = 105539126391072. Its totient is φ = 104473074608952.
The previous prime is 105006100500001. The next prime is 105006100500019. The reversal of 105006100500011 is 110005001600501.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 105006100500011 - 210 = 105006100498987 is a prime.
It is a super-2 number, since 2×1050061005000112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (105006100500019) 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 3 ways as a sum of consecutive naturals, for example, 266512945235 + ... + 266512945628.
It is an arithmetic number, because the mean of its divisors is an integer number (26384781597768).
Almost surely, 2105006100500011 is an apocalyptic number.
105006100500011 is a deficient number, since it is larger than the sum of its proper divisors (533025891061).
105006100500011 is an equidigital number, since it uses as much as digits as its factorization.
105006100500011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 533025891060.
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 105006100500011 in words is "one hundred five trillion, six billion, one hundred million, five hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •