Base | Representation |
---|---|
bin | 10011100010011011000100 |
3 | 100122012200210 |
4 | 103202123010 |
5 | 2302343412 |
6 | 301435420 |
7 | 61351110 |
oct | 23423304 |
9 | 10565623 |
10 | 5121732 |
11 | 2989040 |
12 | 186bb70 |
13 | 10a4315 |
14 | 974740 |
15 | 6b283c |
hex | 4e26c4 |
5121732 has 96 divisors (see below), whose sum is σ = 15611904. Its totient is φ = 1267200.
The previous prime is 5121713. The next prime is 5121737. The reversal of 5121732 is 2371215.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 5121699 and 5121708.
It is not an unprimeable number, because it can be changed into a prime (5121737) 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, 21132 + ... + 21372.
It is an arithmetic number, because the mean of its divisors is an integer number (162624).
Almost surely, 25121732 is an apocalyptic number.
5121732 is the 1848-th pentagonal number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5121732, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (7805952).
5121732 is an abundant number, since it is smaller than the sum of its proper divisors (10490172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5121732 is a wasteful number, since it uses less digits than its factorization.
5121732 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 289 (or 287 counting only the distinct ones).
The product of its digits is 420, while the sum is 21.
The square root of 5121732 is about 2263.1243889809. The cubic root of 5121732 is about 172.3742078078.
Adding to 5121732 its reverse (2371215), we get a palindrome (7492947).
The spelling of 5121732 in words is "five million, one hundred twenty-one thousand, seven hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •