Base | Representation |
---|---|
bin | 1100100101110… |
… | …00010001101101 |
3 | 21100201122222021 |
4 | 12102320101231 |
5 | 204014044042 |
6 | 14251350141 |
7 | 2421455602 |
oct | 622702155 |
9 | 240648867 |
10 | 105612397 |
11 | 54685180 |
12 | 2b452351 |
13 | 18b5a257 |
14 | 100526a9 |
15 | 9412867 |
hex | 64b846d |
105612397 has 8 divisors (see below), whose sum is σ = 115432992. Its totient is φ = 95828400.
The previous prime is 105612391. The next prime is 105612407. The reversal of 105612397 is 793216501.
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-105612397 is a prime.
It is a super-2 number, since 2×1056123972 = 22307956800171218, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105612391) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2923 + ... + 14824.
It is an arithmetic number, because the mean of its divisors is an integer number (14429124).
Almost surely, 2105612397 is an apocalyptic number.
It is an amenable number.
105612397 is a deficient number, since it is larger than the sum of its proper divisors (9820595).
105612397 is a wasteful number, since it uses less digits than its factorization.
105612397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18299.
The product of its (nonzero) digits is 11340, while the sum is 34.
The square root of 105612397 is about 10276.7892359433. The cubic root of 105612397 is about 472.6847958146.
Adding to 105612397 its reverse (793216501), we get a palindrome (898828898).
The spelling of 105612397 in words is "one hundred five million, six hundred twelve thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •