Base | Representation |
---|---|
bin | 110001001000001001… |
… | …0111100010110101011 |
3 | 101002022111001101001112 |
4 | 1202100102330112223 |
5 | 3212031011200021 |
6 | 120244401140535 |
7 | 10423251024335 |
oct | 1422022742653 |
9 | 332274041045 |
10 | 105500100011 |
11 | 408190686a9 |
12 | 1854392a74b |
13 | 9c44159aa7 |
14 | 516b702455 |
15 | 2b27028d5b |
hex | 18904bc5ab |
105500100011 has 8 divisors (see below), whose sum is σ = 108095450400. Its totient is φ = 102905805760.
The previous prime is 105500099993. The next prime is 105500100049. The reversal of 105500100011 is 110001005501.
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-105500100011 is a prime.
It is a super-3 number, since 3×1055001000113 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (105500106011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59876 + ... + 463233.
It is an arithmetic number, because the mean of its divisors is an integer number (13511931300).
Almost surely, 2105500100011 is an apocalyptic number.
105500100011 is a deficient number, since it is larger than the sum of its proper divisors (2595350389).
105500100011 is an equidigital number, since it uses as much as digits as its factorization.
105500100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 528069.
The product of its (nonzero) digits is 25, while the sum is 14.
Adding to 105500100011 its reverse (110001005501), we get a palindrome (215501105512).
The spelling of 105500100011 in words is "one hundred five billion, five hundred million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •