Base | Representation |
---|---|
bin | 100010011110… |
… | …0110110000111 |
3 | 1021000022021000 |
4 | 1010330312013 |
5 | 14111400030 |
6 | 1443224343 |
7 | 306430560 |
oct | 104746607 |
9 | 37008230 |
10 | 18075015 |
11 | a226032 |
12 | 60780b3 |
13 | 398b19a |
14 | 2587167 |
15 | 18c0860 |
hex | 113cd87 |
18075015 has 64 divisors (see below), whose sum is σ = 37969920. Its totient is φ = 7983360.
The previous prime is 18075011. The next prime is 18075017. The reversal of 18075015 is 51057081.
It is not a de Polignac number, because 18075015 - 22 = 18075011 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 18075015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (18075011) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 28987 + ... + 29603.
It is an arithmetic number, because the mean of its divisors is an integer number (593280).
Almost surely, 218075015 is an apocalyptic number.
18075015 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
18075015 is an abundant number, since it is smaller than the sum of its proper divisors (19894905).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
18075015 is a wasteful number, since it uses less digits than its factorization.
18075015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 669 (or 663 counting only the distinct ones).
The product of its (nonzero) digits is 1400, while the sum is 27.
The square root of 18075015 is about 4251.4720979915. The cubic root of 18075015 is about 262.4376995008.
The spelling of 18075015 in words is "eighteen million, seventy-five thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •