Base | Representation |
---|---|
bin | 1100100001100… |
… | …00010010000000 |
3 | 21022200100212021 |
4 | 12100300102000 |
5 | 203343232420 |
6 | 14231411224 |
7 | 2413645564 |
oct | 620602200 |
9 | 238610767 |
10 | 105055360 |
11 | 54334713 |
12 | 2b223b14 |
13 | 189c3847 |
14 | dd496a4 |
15 | 93527aa |
hex | 6430480 |
105055360 has 32 divisors (see below), whose sum is σ = 251149500. Its totient is φ = 42021888.
The previous prime is 105055337. The next prime is 105055361. The reversal of 105055360 is 63550501.
It can be written as a sum of positive squares in 2 ways, for example, as 105021504 + 33856 = 10248^2 + 184^2 .
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×1050553602 = 22073257329459200, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (105055361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81435 + ... + 82714.
Almost surely, 2105055360 is an apocalyptic number.
105055360 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105055360 is an abundant number, since it is smaller than the sum of its proper divisors (146094140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105055360 is an equidigital number, since it uses as much as digits as its factorization.
105055360 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164168 (or 164156 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 25.
The square root of 105055360 is about 10249.6517013994. The cubic root of 105055360 is about 471.8522950641.
The spelling of 105055360 in words is "one hundred five million, fifty-five thousand, three hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •