Base | Representation |
---|---|
bin | 111001100001… |
… | …001010011010 |
3 | 1001101001012000 |
4 | 321201022122 |
5 | 12324444132 |
6 | 1255101430 |
7 | 242106210 |
oct | 71411232 |
9 | 31331160 |
10 | 15078042 |
11 | 85693a1 |
12 | 5071876 |
13 | 317c025 |
14 | 2006cb0 |
15 | 14cc87c |
hex | e6129a |
15078042 has 64 divisors (see below), whose sum is σ = 38741760. Its totient is φ = 4257792.
The previous prime is 15078017. The next prime is 15078097. The reversal of 15078042 is 24087051.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 15077997 and 15078015.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 42538 + ... + 42890.
It is an arithmetic number, because the mean of its divisors is an integer number (605340).
Almost surely, 215078042 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 15078042, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19370880).
15078042 is an abundant number, since it is smaller than the sum of its proper divisors (23663718).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
15078042 is a wasteful number, since it uses less digits than its factorization.
15078042 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 484 (or 478 counting only the distinct ones).
The product of its (nonzero) digits is 2240, while the sum is 27.
The square root of 15078042 is about 3883.0454542794. The cubic root of 15078042 is about 247.0481747511.
Subtracting 15078042 from its reverse (24087051), we obtain a palindrome (9009009).
The spelling of 15078042 in words is "fifteen million, seventy-eight thousand, forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •