Base | Representation |
---|---|
bin | 10110111101110000100001… |
… | …01010010110100111010100 |
3 | 20121210210122000121212022202 |
4 | 23132320100222112213110 |
5 | 23104400013240121000 |
6 | 255223340044344032 |
7 | 13431353406650015 |
oct | 1336702052264724 |
9 | 217723560555282 |
10 | 50500505004500 |
11 | 15100164590981 |
12 | 57b7404b45018 |
13 | 222423c388985 |
14 | c6834792700c |
15 | 5c8979c98dd5 |
hex | 2dee10a969d4 |
50500505004500 has 48 divisors (see below), whose sum is σ = 110306022607872. Its totient is φ = 20197835760800.
The previous prime is 50500505004493. The next prime is 50500505004539. The reversal of 50500505004500 is 540050500505.
50500505004500 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1639832 + ... + 10182831.
It is an arithmetic number, because the mean of its divisors is an integer number (2298042137664).
Almost surely, 250500505004500 is an apocalyptic number.
50500505004500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50500505004500 is an abundant number, since it is smaller than the sum of its proper divisors (59805517603372).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50500505004500 is a wasteful number, since it uses less digits than its factorization.
50500505004500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11831225 (or 11831213 counting only the distinct ones).
The product of its (nonzero) digits is 12500, while the sum is 29.
The spelling of 50500505004500 in words is "fifty trillion, five hundred billion, five hundred five million, four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •