Base | Representation |
---|---|
bin | 10110110101000010111001… |
… | …00011010000010010110100 |
3 | 20120202011220002200100212210 |
4 | 23122201130203100102310 |
5 | 23034443403402020200 |
6 | 254434025254013420 |
7 | 13400624545445232 |
oct | 1332413443202264 |
9 | 216664802610783 |
10 | 50201130501300 |
11 | 14aa51a8477689 |
12 | 5769395047270 |
13 | 2201c3c01201c |
14 | c57a678c7952 |
15 | 5c0ca7492650 |
hex | 2da85c8d04b4 |
50201130501300 has 36 divisors (see below), whose sum is σ = 145248604251296. Its totient is φ = 13386968133600.
The previous prime is 50201130501293. The next prime is 50201130501307. The reversal of 50201130501300 is 310503110205.
It is an interprime number because it is at equal distance from previous prime (50201130501293) and next prime (50201130501307).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50201130501307) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 83668550536 + ... + 83668551135.
Almost surely, 250201130501300 is an apocalyptic number.
50201130501300 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50201130501300 is an abundant number, since it is smaller than the sum of its proper divisors (95047473749996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50201130501300 is a wasteful number, since it uses less digits than its factorization.
50201130501300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167337101688 (or 167337101681 counting only the distinct ones).
The product of its (nonzero) digits is 450, while the sum is 21.
Adding to 50201130501300 its reverse (310503110205), we get a palindrome (50511633611505).
The spelling of 50201130501300 in words is "fifty trillion, two hundred one billion, one hundred thirty million, five hundred one thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •