Base | Representation |
---|---|
bin | 10011011110001001110010 |
3 | 100121022201000 |
4 | 103132021302 |
5 | 2301313432 |
6 | 301222430 |
7 | 61246113 |
oct | 23361162 |
9 | 10538630 |
10 | 5104242 |
11 | 2976990 |
12 | 1861a16 |
13 | 1099380 |
14 | 96c20a |
15 | 6ac57c |
hex | 4de272 |
5104242 has 64 divisors (see below), whose sum is σ = 13345920. Its totient is φ = 1425600.
The previous prime is 5104207. The next prime is 5104249. The reversal of 5104242 is 2424015.
5104242 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5104249) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7392 + ... + 8052.
It is an arithmetic number, because the mean of its divisors is an integer number (208530).
Almost surely, 25104242 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5104242, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6672960).
5104242 is an abundant number, since it is smaller than the sum of its proper divisors (8241678).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5104242 is a wasteful number, since it uses less digits than its factorization.
5104242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 696 (or 690 counting only the distinct ones).
The product of its (nonzero) digits is 320, while the sum is 18.
The square root of 5104242 is about 2259.2569574973. The cubic root of 5104242 is about 172.1777727505.
Adding to 5104242 its reverse (2424015), we get a palindrome (7528257).
The spelling of 5104242 in words is "five million, one hundred four thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •