Base | Representation |
---|---|
bin | 1100100001100… |
… | …00010011100101 |
3 | 21022200101000000 |
4 | 12100300103211 |
5 | 203343233321 |
6 | 14231411513 |
7 | 2413646100 |
oct | 620602345 |
9 | 238611000 |
10 | 105055461 |
11 | 543347a5 |
12 | 2b223b99 |
13 | 189c38c4 |
14 | dd49737 |
15 | 9352826 |
hex | 64304e5 |
105055461 has 84 divisors (see below), whose sum is σ = 195126732. Its totient is φ = 56173824.
The previous prime is 105055441. The next prime is 105055463. The reversal of 105055461 is 164550501.
It is a happy number.
105055461 is a `hidden beast` number, since 1 + 0 + 50 + 554 + 61 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 89302500 + 15752961 = 9450^2 + 3969^2 .
It is not a de Polignac number, because 105055461 - 219 = 104531173 is a prime.
It is a super-2 number, since 2×1050554612 = 22073299771845042, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105055463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 83 ways as a sum of consecutive naturals, for example, 607171 + ... + 607343.
Almost surely, 2105055461 is an apocalyptic number.
It is an amenable number.
105055461 is a deficient number, since it is larger than the sum of its proper divisors (90071271).
105055461 is an equidigital number, since it uses as much as digits as its factorization.
105055461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222 (or 200 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 27.
The square root of 105055461 is about 10249.6566283949. The cubic root of 105055461 is about 471.8524462767.
The spelling of 105055461 in words is "one hundred five million, fifty-five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •