Base | Representation |
---|---|
bin | 1100100101110… |
… | …00011110100010 |
3 | 21100201201002200 |
4 | 12102320132202 |
5 | 204014110333 |
6 | 14251354030 |
7 | 2421461154 |
oct | 622703642 |
9 | 240651080 |
10 | 105613218 |
11 | 54685857 |
12 | 2b452916 |
13 | 18b5a739 |
14 | 10052ad4 |
15 | 9412c13 |
hex | 64b87a2 |
105613218 has 24 divisors (see below), whose sum is σ = 236211456. Its totient is φ = 34068600.
The previous prime is 105613201. The next prime is 105613241. The reversal of 105613218 is 812316501.
It is a super-2 number, since 2×1056132182 = 22308303632631048, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 105613191 and 105613200.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 94078 + ... + 95193.
It is an arithmetic number, because the mean of its divisors is an integer number (9842144).
Almost surely, 2105613218 is an apocalyptic number.
105613218 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
105613218 is an abundant number, since it is smaller than the sum of its proper divisors (130598238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105613218 is a wasteful number, since it uses less digits than its factorization.
105613218 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 189310 (or 189307 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 105613218 is about 10276.8291802482. The cubic root of 105613218 is about 472.6860206494.
Adding to 105613218 its reverse (812316501), we get a palindrome (917929719).
The spelling of 105613218 in words is "one hundred five million, six hundred thirteen thousand, two hundred eighteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •