Base | Representation |
---|---|
bin | 1110111101011… |
… | …11101011110001 |
3 | 22202011001211112 |
4 | 13132233223301 |
5 | 224112001040 |
6 | 20241523105 |
7 | 3052506431 |
oct | 736575361 |
9 | 282131745 |
10 | 125500145 |
11 | 64929131 |
12 | 36043495 |
13 | 20001554 |
14 | 1294c2c1 |
15 | b040365 |
hex | 77afaf1 |
125500145 has 4 divisors (see below), whose sum is σ = 150600180. Its totient is φ = 100400112.
The previous prime is 125500127. The next prime is 125500157. The reversal of 125500145 is 541005521.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 83302129 + 42198016 = 9127^2 + 6496^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-125500145 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 125500145.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12550010 + ... + 12550019.
It is an arithmetic number, because the mean of its divisors is an integer number (37650045).
Almost surely, 2125500145 is an apocalyptic number.
It is an amenable number.
125500145 is a deficient number, since it is larger than the sum of its proper divisors (25100035).
125500145 is an equidigital number, since it uses as much as digits as its factorization.
125500145 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25100034.
The product of its (nonzero) digits is 1000, while the sum is 23.
The square root of 125500145 is about 11202.6847228689. The cubic root of 125500145 is about 500.6659725673.
Adding to 125500145 its reverse (541005521), we get a palindrome (666505666).
The spelling of 125500145 in words is "one hundred twenty-five million, five hundred thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •