Base | Representation |
---|---|
bin | 1110111011100… |
… | …10101111000101 |
3 | 22201200101101110 |
4 | 13131302233011 |
5 | 224031004001 |
6 | 20232315233 |
7 | 3050416545 |
oct | 735625705 |
9 | 281611343 |
10 | 125250501 |
11 | 64778612 |
12 | 35b42b19 |
13 | 1cc44a2c |
14 | 128c5325 |
15 | aee13d6 |
hex | 7772bc5 |
125250501 has 24 divisors (see below), whose sum is σ = 173154240. Its totient is φ = 80519296.
The previous prime is 125250493. The next prime is 125250511. The reversal of 125250501 is 105052521.
It is not a de Polignac number, because 125250501 - 23 = 125250493 is a prime.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (125250511) by changing a digit.
It is a nontrivial repunit in base 500.
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 23 ways as a sum of consecutive naturals, for example, 749920 + ... + 750086.
It is an arithmetic number, because the mean of its divisors is an integer number (7214760).
Almost surely, 2125250501 is an apocalyptic number.
It is an amenable number.
125250501 is a deficient number, since it is larger than the sum of its proper divisors (47903739).
125250501 is an equidigital number, since it uses as much as digits as its factorization.
125250501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365 (or 312 counting only the distinct ones).
The product of its (nonzero) digits is 500, while the sum is 21.
The square root of 125250501 is about 11191.5370258066. The cubic root of 125250501 is about 500.3337784676. Note that the first 3 decimals are identical.
It can be divided in two parts, 125250 and 501, that added together give a triangular number (125751 = T501).
The spelling of 125250501 in words is "one hundred twenty-five million, two hundred fifty thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •