Base | Representation |
---|---|
bin | 100110001001000011111… |
… | …1011111011111111011100 |
3 | 200120010212210122002012011 |
4 | 1030102013323323333130 |
5 | 1141341401012100000 |
6 | 15052112312521004 |
7 | 1050506064033142 |
oct | 114220773737734 |
9 | 20503783562164 |
10 | 5242140737500 |
11 | 17411a7869547 |
12 | 707b663b0164 |
13 | 2c0440b17c74 |
14 | 141a14487592 |
15 | 915605902ba |
hex | 4c487efbfdc |
5242140737500 has 72 divisors (see below), whose sum is σ = 11964990879072. Its totient is φ = 2005688520000.
The previous prime is 5242140737489. The next prime is 5242140737507. The reversal of 5242140737500 is 57370412425.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5242140737507) 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, 8829267 + ... + 9404266.
It is an arithmetic number, because the mean of its divisors is an integer number (166180428876).
Almost surely, 25242140737500 is an apocalyptic number.
5242140737500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5242140737500 is an abundant number, since it is smaller than the sum of its proper divisors (6722850141572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5242140737500 is a wasteful number, since it uses less digits than its factorization.
5242140737500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18233585 (or 18233563 counting only the distinct ones).
The product of its (nonzero) digits is 235200, while the sum is 40.
The spelling of 5242140737500 in words is "five trillion, two hundred forty-two billion, one hundred forty million, seven hundred thirty-seven thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •