Base | Representation |
---|---|
bin | 11110001100000… |
… | …010010100111110 |
3 | 1022022000102121200 |
4 | 132030002110332 |
5 | 2014124043432 |
6 | 122131240330 |
7 | 15356640000 |
oct | 3614022476 |
9 | 1268012550 |
10 | 506471742 |
11 | 23a987797 |
12 | 1217490a6 |
13 | 80c0ca2a |
14 | 4b39c370 |
15 | 2e6e5a7c |
hex | 1e30253e |
506471742 has 60 divisors (see below), whose sum is σ = 1280281080. Its totient is φ = 144693864.
The previous prime is 506471741. The next prime is 506471761. The reversal of 506471742 is 247174605.
506471742 is a `hidden beast` number, since 5 + 0 + 647 + 1 + 7 + 4 + 2 = 666.
It is a junction number, because it is equal to n+sod(n) for n = 506471697 and 506471706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (506471741) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 37359 + ... + 49077.
It is an arithmetic number, because the mean of its divisors is an integer number (21338018).
Almost surely, 2506471742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 506471742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (640140540).
506471742 is an abundant number, since it is smaller than the sum of its proper divisors (773809338).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506471742 is a wasteful number, since it uses less digits than its factorization.
506471742 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11755 (or 11731 counting only the distinct ones).
The product of its (nonzero) digits is 47040, while the sum is 36.
The square root of 506471742 is about 22504.9270605350. The cubic root of 506471742 is about 797.1102733765.
The spelling of 506471742 in words is "five hundred six million, four hundred seventy-one thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.257 sec. • engine limits •