Base | Representation |
---|---|
bin | 10110110111111011100001… |
… | …01100101000000011001100 |
3 | 20121002122202002200022202010 |
4 | 23123331300230220003030 |
5 | 23043104404201000103 |
6 | 254551341143501220 |
7 | 13411034103611151 |
oct | 1333756054500314 |
9 | 217078662608663 |
10 | 50300252750028 |
11 | 15033243397206 |
12 | 5784638a57810 |
13 | 220b3a7a17bc8 |
14 | c5c78c140228 |
15 | 5c36595e7903 |
hex | 2dbf70b280cc |
50300252750028 has 24 divisors (see below), whose sum is σ = 121153296947200. Its totient is φ = 16225887983760.
The previous prime is 50300252750023. The next prime is 50300252750051. The reversal of 50300252750028 is 82005725200305.
50300252750028 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×503002527500283 (a number of 42 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (50300252750023) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 67607866228 + ... + 67607866971.
Almost surely, 250300252750028 is an apocalyptic number.
It is an amenable number.
50300252750028 is an abundant number, since it is smaller than the sum of its proper divisors (70853044197172).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50300252750028 is a wasteful number, since it uses less digits than its factorization.
50300252750028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135215733237 (or 135215733235 counting only the distinct ones).
The product of its (nonzero) digits is 168000, while the sum is 39.
The spelling of 50300252750028 in words is "fifty trillion, three hundred billion, two hundred fifty-two million, seven hundred fifty thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •