Base | Representation |
---|---|
bin | 10011011110011000010100 |
3 | 100121100222110 |
4 | 103132120110 |
5 | 2301331142 |
6 | 301231020 |
7 | 61251612 |
oct | 23363024 |
9 | 10540873 |
10 | 5105172 |
11 | 2977656 |
12 | 1862470 |
13 | 1099917 |
14 | 96c6b2 |
15 | 6ac99c |
hex | 4de614 |
5105172 has 48 divisors (see below), whose sum is σ = 12700800. Its totient is φ = 1592448.
The previous prime is 5105171. The next prime is 5105179. The reversal of 5105172 is 2715015.
It is a super-4 number, since 4×51051724 (a number of 28 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5105171) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 14454 + ... + 14802.
It is an arithmetic number, because the mean of its divisors is an integer number (264600).
Almost surely, 25105172 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5105172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (6350400).
5105172 is an abundant number, since it is smaller than the sum of its proper divisors (7595628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5105172 is a wasteful number, since it uses less digits than its factorization.
5105172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 432 (or 430 counting only the distinct ones).
The product of its (nonzero) digits is 350, while the sum is 21.
The square root of 5105172 is about 2259.4627680048. The cubic root of 5105172 is about 172.1882291255.
The spelling of 5105172 in words is "five million, one hundred five thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •