Base | Representation |
---|---|
bin | 1100000010101… |
… | …0010110100101 |
3 | 10112000221000012 |
4 | 3000222112211 |
5 | 100412131000 |
6 | 5002300005 |
7 | 1152200156 |
oct | 300522645 |
9 | 115027005 |
10 | 50505125 |
11 | 26566280 |
12 | 14ab7605 |
13 | a6042b8 |
14 | 69c992d |
15 | 4679735 |
hex | 302a5a5 |
50505125 has 32 divisors (see below), whose sum is σ = 71794944. Its totient is φ = 35112000.
The previous prime is 50505109. The next prime is 50505127. The reversal of 50505125 is 52150505.
It is not a de Polignac number, because 50505125 - 24 = 50505109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
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 50505125.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50505127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 30827 + ... + 32423.
It is an arithmetic number, because the mean of its divisors is an integer number (2243592).
Almost surely, 250505125 is an apocalyptic number.
50505125 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50505125 is a deficient number, since it is larger than the sum of its proper divisors (21289819).
50505125 is a wasteful number, since it uses less digits than its factorization.
50505125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1646 (or 1636 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 23.
The square root of 50505125 is about 7106.6957863694. The cubic root of 50505125 is about 369.6395930494.
The spelling of 50505125 in words is "fifty million, five hundred five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •