Base | Representation |
---|---|
bin | 110001001001101010… |
… | …1100010001101100101 |
3 | 101002110001000222222220 |
4 | 1202103111202031211 |
5 | 3212132041023023 |
6 | 120253422342553 |
7 | 10424440432425 |
oct | 1422325421545 |
9 | 332401028886 |
10 | 105551111013 |
11 | 40844939a57 |
12 | 18558a2aa59 |
13 | 9c518aa40a |
14 | 51743c0485 |
15 | 2b2b7533e3 |
hex | 1893562365 |
105551111013 has 8 divisors (see below), whose sum is σ = 141096602400. Its totient is φ = 70186513488.
The previous prime is 105551110999. The next prime is 105551111021. The reversal of 105551111013 is 310111155501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105551111013 - 212 = 105551106917 is a prime.
It is a super-2 number, since 2×1055511110132 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105551111023) 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, 45222103 + ... + 45224436.
It is an arithmetic number, because the mean of its divisors is an integer number (17637075300).
Almost surely, 2105551111013 is an apocalyptic number.
It is an amenable number.
105551111013 is a deficient number, since it is larger than the sum of its proper divisors (35545491387).
105551111013 is an equidigital number, since it uses as much as digits as its factorization.
105551111013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90446931.
The product of its (nonzero) digits is 375, while the sum is 24.
Adding to 105551111013 its reverse (310111155501), we get a palindrome (415662266514).
The spelling of 105551111013 in words is "one hundred five billion, five hundred fifty-one million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •