Base | Representation |
---|---|
bin | 100110001000010000011… |
… | …0001111001111101100100 |
3 | 200112222102012001021102210 |
4 | 1030100200301321331210 |
5 | 1141324324433221000 |
6 | 15051224450203420 |
7 | 1050415150336125 |
oct | 114204061717544 |
9 | 20488365037383 |
10 | 5240410054500 |
11 | 1740499949815 |
12 | 707762883570 |
13 | 2c02263b789a |
14 | 1418cc69604c |
15 | 914ad67a350 |
hex | 4c420c79f64 |
5240410054500 has 96 divisors (see below), whose sum is σ = 16063235959680. Its totient is φ = 1323893059200.
The previous prime is 5240410054493. The next prime is 5240410054513. The reversal of 5240410054500 is 54500140425.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 91908519 + ... + 91965518.
It is an arithmetic number, because the mean of its divisors is an integer number (167325374580).
Almost surely, 25240410054500 is an apocalyptic number.
5240410054500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5240410054500 is an abundant number, since it is smaller than the sum of its proper divisors (10822825905180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5240410054500 is a wasteful number, since it uses less digits than its factorization.
5240410054500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183874078 (or 183874066 counting only the distinct ones).
The product of its (nonzero) digits is 16000, while the sum is 30.
Adding to 5240410054500 its reverse (54500140425), we get a palindrome (5294910194925).
The spelling of 5240410054500 in words is "five trillion, two hundred forty billion, four hundred ten million, fifty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •