Base | Representation |
---|---|
bin | 1100100001011… |
… | …11011000000001 |
3 | 21022200011202211 |
4 | 12100233120001 |
5 | 203343123044 |
6 | 14231342121 |
7 | 2413632013 |
oct | 620573001 |
9 | 238604684 |
10 | 105051649 |
11 | 5433194a |
12 | 2b221941 |
13 | 189c1c51 |
14 | dd481b3 |
15 | 9351634 |
hex | 642f601 |
105051649 has 8 divisors (see below), whose sum is σ = 109812672. Its totient is φ = 100306800.
The previous prime is 105051647. The next prime is 105051673. The reversal of 105051649 is 946150501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 105051649 - 21 = 105051647 is a prime.
It is a super-3 number, since 3×1050516493 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 105051649.
It is not an unprimeable number, because it can be changed into a prime (105051643) 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 7 ways as a sum of consecutive naturals, for example, 10374 + ... + 17824.
It is an arithmetic number, because the mean of its divisors is an integer number (13726584).
Almost surely, 2105051649 is an apocalyptic number.
It is an amenable number.
105051649 is a deficient number, since it is larger than the sum of its proper divisors (4761023).
105051649 is an equidigital number, since it uses as much as digits as its factorization.
105051649 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8087.
The product of its (nonzero) digits is 5400, while the sum is 31.
The square root of 105051649 is about 10249.4706692590. The cubic root of 105051649 is about 471.8467390586.
The spelling of 105051649 in words is "one hundred five million, fifty-one thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.136 sec. • engine limits •