Base | Representation |
---|---|
bin | 100110001000010111101… |
… | …1101000010111100010100 |
3 | 200120000001100022000121221 |
4 | 1030100233131002330110 |
5 | 1141330330444311000 |
6 | 15051305123020124 |
7 | 1050424230042205 |
oct | 114205735027424 |
9 | 20500040260557 |
10 | 5240656244500 |
11 | 174060590aa26 |
12 | 70781120a644 |
13 | 2c02653c5041 |
14 | 14191325d5ac |
15 | 914c50aa61a |
hex | 4c42f742f14 |
5240656244500 has 96 divisors (see below), whose sum is σ = 11750575060224. Its totient is φ = 2041008944000.
The previous prime is 5240656244477. The next prime is 5240656244611. The reversal of 5240656244500 is 54426560425.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2716689 + ... + 4226311.
It is an arithmetic number, because the mean of its divisors is an integer number (122401823544).
Almost surely, 25240656244500 is an apocalyptic number.
5240656244500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 5240656244500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5875287530112).
5240656244500 is an abundant number, since it is smaller than the sum of its proper divisors (6509918815724).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5240656244500 is a wasteful number, since it uses less digits than its factorization.
5240656244500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1509826 (or 1509814 counting only the distinct ones).
The product of its (nonzero) digits is 1152000, while the sum is 43.
The spelling of 5240656244500 in words is "five trillion, two hundred forty billion, six hundred fifty-six million, two hundred forty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •