Base | Representation |
---|---|
bin | 1100100001011… |
… | …00100010111101 |
3 | 21022122120212122 |
4 | 12100230202331 |
5 | 203342240221 |
6 | 14231212325 |
7 | 2413553150 |
oct | 620544275 |
9 | 238576778 |
10 | 105040061 |
11 | 54324175 |
12 | 2b2170a5 |
13 | 189b98a9 |
14 | dd43c97 |
15 | 934ceab |
hex | 642c8bd |
105040061 has 8 divisors (see below), whose sum is σ = 120167424. Its totient is φ = 89943120.
The previous prime is 105040051. The next prime is 105040063. The reversal of 105040061 is 160040501.
It is a happy number.
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-105040061 is a prime.
It is a super-2 number, since 2×1050400612 = 22066828829767442, 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 (105040063) 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, 356 + ... + 14498.
It is an arithmetic number, because the mean of its divisors is an integer number (15020928).
Almost surely, 2105040061 is an apocalyptic number.
It is an amenable number.
105040061 is a deficient number, since it is larger than the sum of its proper divisors (15127363).
105040061 is a wasteful number, since it uses less digits than its factorization.
105040061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15211.
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 105040061 is about 10248.9053561832. The cubic root of 105040061 is about 471.8293889864.
Adding to 105040061 its reverse (160040501), we get a palindrome (265080562).
The spelling of 105040061 in words is "one hundred five million, forty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •