Base | Representation |
---|---|
bin | 1100100100001… |
… | …11011010010101 |
3 | 21100100111102020 |
4 | 12102013122111 |
5 | 203441142440 |
6 | 14243203353 |
7 | 2416663221 |
oct | 622073225 |
9 | 240314366 |
10 | 105412245 |
11 | 54558864 |
12 | 2b376559 |
13 | 18aba113 |
14 | dddd781 |
15 | 93c33d0 |
hex | 6487695 |
105412245 has 32 divisors (see below), whose sum is σ = 180126720. Its totient is φ = 52523520.
The previous prime is 105412231. The next prime is 105412259. The reversal of 105412245 is 542214501.
It is an interprime number because it is at equal distance from previous prime (105412231) and next prime (105412259).
It is not a de Polignac number, because 105412245 - 28 = 105411989 is a prime.
It is a super-2 number, since 2×1054122452 = 22223482791880050, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9577 + ... + 17393.
It is an arithmetic number, because the mean of its divisors is an integer number (5628960).
Almost surely, 2105412245 is an apocalyptic number.
105412245 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
105412245 is a deficient number, since it is larger than the sum of its proper divisors (74714475).
105412245 is a wasteful number, since it uses less digits than its factorization.
105412245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7885.
The product of its (nonzero) digits is 1600, while the sum is 24.
The square root of 105412245 is about 10267.0465568244. The cubic root of 105412245 is about 472.3860031252.
Adding to 105412245 its reverse (542214501), we get a palindrome (647626746).
The spelling of 105412245 in words is "one hundred five million, four hundred twelve thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •