Base | Representation |
---|---|
bin | 1001011000110001… |
… | …10110111111011100 |
3 | 111000020001100100101 |
4 | 10230120312333130 |
5 | 40310124302000 |
6 | 2152025510444 |
7 | 235613404660 |
oct | 45430667734 |
9 | 14006040311 |
10 | 5039681500 |
11 | 2156850337 |
12 | b87942424 |
13 | 624143479 |
14 | 35b4708a0 |
15 | 1e7693e6a |
hex | 12c636fdc |
5039681500 has 48 divisors (see below), whose sum is σ = 12579053760. Its totient is φ = 1727889600.
The previous prime is 5039681483. The next prime is 5039681503. The reversal of 5039681500 is 51869305.
It is a self number, because there is not a number n which added to its sum of digits gives 5039681500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5039681503) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 716455 + ... + 723454.
It is an arithmetic number, because the mean of its divisors is an integer number (262063620).
Almost surely, 25039681500 is an apocalyptic number.
5039681500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5039681500 is an abundant number, since it is smaller than the sum of its proper divisors (7539372260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5039681500 is a wasteful number, since it uses less digits than its factorization.
5039681500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1439935 (or 1439923 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 37.
The square root of 5039681500 is about 70990.7141815040. The cubic root of 5039681500 is about 1714.4876595760.
The spelling of 5039681500 in words is "five billion, thirty-nine million, six hundred eighty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.022 sec. • engine limits •