Base | Representation |
---|---|
bin | 100110011101010111100… |
… | …1101111011001000000000 |
3 | 200201022102222002112200000 |
4 | 1030322233031323020000 |
5 | 1143100203323440203 |
6 | 15124123442400000 |
7 | 1053611540620422 |
oct | 114725715731000 |
9 | 20638388075600 |
10 | 5285749436928 |
11 | 1758745837904 |
12 | 7144b6960000 |
13 | 2c45a070521c |
14 | 143b9002a812 |
15 | 92763ca64a3 |
hex | 4ceaf37b200 |
5285749436928 has 480 divisors, whose sum is σ = 16145668611072. Its totient is φ = 1725973401600.
The previous prime is 5285749436921. The next prime is 5285749436963. The reversal of 5285749436928 is 8296349475825.
5285749436928 is a `hidden beast` number, since 5 + 2 + 8 + 57 + 494 + 3 + 69 + 28 = 666.
It is a Harshad number since it is a multiple of its sum of digits (72).
It is not an unprimeable number, because it can be changed into a prime (5285749436921) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1439864533 + ... + 1439868203.
Almost surely, 25285749436928 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 5285749436928, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8072834305536).
5285749436928 is an abundant number, since it is smaller than the sum of its proper divisors (10859919174144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5285749436928 is an equidigital number, since it uses as much as digits as its factorization.
5285749436928 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3938 (or 3910 counting only the distinct ones).
The product of its digits is 1045094400, while the sum is 72.
The spelling of 5285749436928 in words is "five trillion, two hundred eighty-five billion, seven hundred forty-nine million, four hundred thirty-six thousand, nine hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •