Base | Representation |
---|---|
bin | 11110000110100… |
… | …100000001001000 |
3 | 1022012022112100100 |
4 | 132012210001020 |
5 | 2013242134442 |
6 | 122040405400 |
7 | 15341512464 |
oct | 3606440110 |
9 | 1265275310 |
10 | 505036872 |
11 | 23a09774a |
12 | 121176860 |
13 | 808298b2 |
14 | 4b1074a4 |
15 | 2e51084c |
hex | 1e1a4048 |
505036872 has 96 divisors (see below), whose sum is σ = 1486368000. Its totient is φ = 154327680.
The previous prime is 505036871. The next prime is 505036933. The reversal of 505036872 is 278630505.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (505036871) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36454 + ... + 48362.
It is an arithmetic number, because the mean of its divisors is an integer number (15483000).
Almost surely, 2505036872 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 505036872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (743184000).
505036872 is an abundant number, since it is smaller than the sum of its proper divisors (981331128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
505036872 is a wasteful number, since it uses less digits than its factorization.
505036872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11971 (or 11964 counting only the distinct ones).
The product of its (nonzero) digits is 50400, while the sum is 36.
The square root of 505036872 is about 22473.0254305022. The cubic root of 505036872 is about 796.3568049307.
It can be divided in two parts, 50503 and 6872, that added together give a palindrome (57375).
The spelling of 505036872 in words is "five hundred five million, thirty-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •