Base | Representation |
---|---|
bin | 101111000010001010… |
… | …001110010101001101 |
3 | 11211100120121111202022 |
4 | 233002022032111031 |
5 | 1311412014202201 |
6 | 35111135135525 |
7 | 3435326525012 |
oct | 570212162515 |
9 | 154316544668 |
10 | 50502100301 |
11 | 1a466134484 |
12 | 99550745a5 |
13 | 49baaabab3 |
14 | 26312b1709 |
15 | 14a89c541b |
hex | bc228e54d |
50502100301 has 16 divisors (see below), whose sum is σ = 54390009600. Its totient is φ = 46744746048.
The previous prime is 50502100261. The next prime is 50502100303. The reversal of 50502100301 is 10300120505.
It is not a de Polignac number, because 50502100301 - 226 = 50434991437 is a prime.
It is a super-4 number, since 4×505021003014 (a number of 44 digits) contains 4444 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50502100301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50502100303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 135755 + ... + 345591.
It is an arithmetic number, because the mean of its divisors is an integer number (3399375600).
Almost surely, 250502100301 is an apocalyptic number.
It is an amenable number.
50502100301 is a deficient number, since it is larger than the sum of its proper divisors (3887909299).
50502100301 is a wasteful number, since it uses less digits than its factorization.
50502100301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210148.
The product of its (nonzero) digits is 150, while the sum is 17.
Adding to 50502100301 its reverse (10300120505), we get a palindrome (60802220806).
The spelling of 50502100301 in words is "fifty billion, five hundred two million, one hundred thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.206 sec. • engine limits •