Base | Representation |
---|---|
bin | 1110111101110… |
… | …11100111110001 |
3 | 22202020112220111 |
4 | 13132323213301 |
5 | 224120032131 |
6 | 20242541321 |
7 | 3053102122 |
oct | 736734761 |
9 | 282215814 |
10 | 125549041 |
11 | 64961942 |
12 | 36067841 |
13 | 2001a897 |
14 | 12962049 |
15 | b04eab1 |
hex | 77bb9f1 |
125549041 has 8 divisors (see below), whose sum is σ = 128355624. Its totient is φ = 122766720.
The previous prime is 125549027. The next prime is 125549051. The reversal of 125549041 is 140945521.
It can be written as a sum of positive squares in 4 ways, for example, as 50466816 + 75082225 = 7104^2 + 8665^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 125549041 - 29 = 125548529 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 125548994 and 125549012.
It is not an unprimeable number, because it can be changed into a prime (125549051) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 4605 + ... + 16501.
It is an arithmetic number, because the mean of its divisors is an integer number (16044453).
Almost surely, 2125549041 is an apocalyptic number.
It is an amenable number.
125549041 is a deficient number, since it is larger than the sum of its proper divisors (2806583).
125549041 is a wasteful number, since it uses less digits than its factorization.
125549041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12131.
The product of its (nonzero) digits is 7200, while the sum is 31.
The square root of 125549041 is about 11204.8668443672. The cubic root of 125549041 is about 500.7309854664.
The spelling of 125549041 in words is "one hundred twenty-five million, five hundred forty-nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •