Base | Representation |
---|---|
bin | 1110101111010011110… |
… | …00101101100101100100 |
3 | 1210102012100001021110102 |
4 | 13113221320231211210 |
5 | 31244134343203443 |
6 | 1024353022243232 |
7 | 51405635410400 |
oct | 7275170554544 |
9 | 1712170037412 |
10 | 506435131748 |
11 | 18586147a1a7 |
12 | 82198126518 |
13 | 389ab408b40 |
14 | 1a723b40100 |
15 | d290a6dcb8 |
hex | 75e9e2d964 |
506435131748 has 72 divisors (see below), whose sum is σ = 1112094127872. Its totient is φ = 200017290816.
The previous prime is 506435131747. The next prime is 506435131751. The reversal of 506435131748 is 847131534605.
It is a super-2 number, since 2×5064351317482 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (506435131747) 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, 1382915 + ... + 1710357.
It is an arithmetic number, because the mean of its divisors is an integer number (15445751776).
Almost surely, 2506435131748 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 506435131748, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (556047063936).
506435131748 is an abundant number, since it is smaller than the sum of its proper divisors (605658996124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
506435131748 is a wasteful number, since it uses less digits than its factorization.
506435131748 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 328081 (or 328072 counting only the distinct ones).
The product of its (nonzero) digits is 1209600, while the sum is 47.
The spelling of 506435131748 in words is "five hundred six billion, four hundred thirty-five million, one hundred thirty-one thousand, seven hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •