Base | Representation |
---|---|
bin | 1100100101111… |
… | …11010101110011 |
3 | 21100210010122220 |
4 | 12102333111303 |
5 | 204021010311 |
6 | 14252132123 |
7 | 2421636135 |
oct | 622772563 |
9 | 240703586 |
10 | 105641331 |
11 | 546a4994 |
12 | 2b467043 |
13 | 18b6a483 |
14 | 1005d055 |
15 | 941b206 |
hex | 64bf573 |
105641331 has 4 divisors (see below), whose sum is σ = 140855112. Its totient is φ = 70427552.
The previous prime is 105641279. The next prime is 105641351. The reversal of 105641331 is 133146501.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 133146501 = 3 ⋅44382167.
It is a cyclic number.
It is not a de Polignac number, because 105641331 - 217 = 105510259 is a prime.
It is a super-2 number, since 2×1056413312 = 22320181630903122, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105641351) 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 3 ways as a sum of consecutive naturals, for example, 17606886 + ... + 17606891.
It is an arithmetic number, because the mean of its divisors is an integer number (35213778).
Almost surely, 2105641331 is an apocalyptic number.
105641331 is a deficient number, since it is larger than the sum of its proper divisors (35213781).
105641331 is an equidigital number, since it uses as much as digits as its factorization.
105641331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35213780.
The product of its (nonzero) digits is 1080, while the sum is 24.
The square root of 105641331 is about 10278.1968749387. The cubic root of 105641331 is about 472.7279580869.
Adding to 105641331 its reverse (133146501), we get a palindrome (238787832).
The spelling of 105641331 in words is "one hundred five million, six hundred forty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •