Base | Representation |
---|---|
bin | 1100011011011… |
… | …01110111000111 |
3 | 21021011220111000 |
4 | 12031231313013 |
5 | 203142242030 |
6 | 14202344343 |
7 | 2404121100 |
oct | 615556707 |
9 | 237156430 |
10 | 104259015 |
11 | 53940383 |
12 | 2aabb0b3 |
13 | 187a5233 |
14 | dbbd3a7 |
15 | 9246860 |
hex | 636ddc7 |
104259015 has 48 divisors (see below), whose sum is σ = 215624160. Its totient is φ = 47658240.
The previous prime is 104258963. The next prime is 104259037. The reversal of 104259015 is 510952401.
It is not a de Polignac number, because 104259015 - 26 = 104258951 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a self number, because there is not a number n which added to its sum of digits gives 104259015.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1266 + ... + 14495.
It is an arithmetic number, because the mean of its divisors is an integer number (4492170).
Almost surely, 2104259015 is an apocalyptic number.
104259015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
104259015 is an abundant number, since it is smaller than the sum of its proper divisors (111365145).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
104259015 is a wasteful number, since it uses less digits than its factorization.
104259015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15789 (or 15776 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 27.
The square root of 104259015 is about 10210.7303852369. The cubic root of 104259015 is about 470.6570183451.
The spelling of 104259015 in words is "one hundred four million, two hundred fifty-nine thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •