Base | Representation |
---|---|
bin | 10111111001011111001110… |
… | …100111010001001101010011 |
3 | 111210010222221202100110111120 |
4 | 113321133032213101031103 |
5 | 102234022242420213021 |
6 | 1011312503503413323 |
7 | 31065426011353113 |
oct | 2771371647211523 |
9 | 453128852313446 |
10 | 105105611101011 |
11 | 30543048406aa4 |
12 | b9562085b4243 |
13 | 468555535cb51 |
14 | 1bd51d2913043 |
15 | c24088b442c6 |
hex | 5f97ce9d1353 |
105105611101011 has 8 divisors (see below), whose sum is σ = 140300610488784. Its totient is φ = 69990509556960.
The previous prime is 105105611100991. The next prime is 105105611101039. The reversal of 105105611101011 is 110101116501501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 105105611101011 - 27 = 105105611100883 is a prime.
It is a super-2 number, since 2×1051056111010112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105105611101811) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19974457860 + ... + 19974463121.
It is an arithmetic number, because the mean of its divisors is an integer number (17537576311098).
Almost surely, 2105105611101011 is an apocalyptic number.
105105611101011 is a deficient number, since it is larger than the sum of its proper divisors (35194999387773).
105105611101011 is an equidigital number, since it uses as much as digits as its factorization.
105105611101011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 39948921861.
The product of its (nonzero) digits is 150, while the sum is 24.
Adding to 105105611101011 its reverse (110101116501501), we get a palindrome (215206727602512).
The spelling of 105105611101011 in words is "one hundred five trillion, one hundred five billion, six hundred eleven million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •