Base | Representation |
---|---|
bin | 100110100101001010110… |
… | …1010010000111110110010 |
3 | 200202220200101020010210022 |
4 | 1031022111222100332302 |
5 | 1143334010113344200 |
6 | 15135533552403442 |
7 | 1055043622552655 |
oct | 115122552207662 |
9 | 20686611203708 |
10 | 5302500528050 |
11 | 1764861348570 |
12 | 7177b0846582 |
13 | 2c603cc7876b |
14 | 1448dca3589c |
15 | 92de46b2885 |
hex | 4d295a90fb2 |
5302500528050 has 48 divisors (see below), whose sum is σ = 10766631650400. Its totient is φ = 1926860140800.
The previous prime is 5302500528047. The next prime is 5302500528077. The reversal of 5302500528050 is 508250052035.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5302500528050.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2501495 + ... + 4106394.
It is an arithmetic number, because the mean of its divisors is an integer number (224304826050).
Almost surely, 25302500528050 is an apocalyptic number.
5302500528050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5302500528050 is an abundant number, since it is smaller than the sum of its proper divisors (5464131122350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5302500528050 is a wasteful number, since it uses less digits than its factorization.
5302500528050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6609371 (or 6609366 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 35.
The spelling of 5302500528050 in words is "five trillion, three hundred two billion, five hundred million, five hundred twenty-eight thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •