Base | Representation |
---|---|
bin | 1110111101111… |
… | …11111001100001 |
3 | 22202021102221101 |
4 | 13132333321201 |
5 | 224121112221 |
6 | 20243154401 |
7 | 3053204161 |
oct | 736777141 |
9 | 282242841 |
10 | 125566561 |
11 | 6497401a |
12 | 36075a01 |
13 | 20025853 |
14 | 129685a1 |
15 | b054d91 |
hex | 77bfe61 |
125566561 has 8 divisors (see below), whose sum is σ = 126794304. Its totient is φ = 124344720.
The previous prime is 125566541. The next prime is 125566577. The reversal of 125566561 is 165665521.
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 125566561 - 213 = 125558369 is a prime.
It is a super-2 number, since 2×1255665612 = 31533922482733442, which contains 22 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 125566561.
It is not an unprimeable number, because it can be changed into a prime (125566501) 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, 49455 + ... + 51931.
It is an arithmetic number, because the mean of its divisors is an integer number (15849288).
Almost surely, 2125566561 is an apocalyptic number.
It is an amenable number.
125566561 is a deficient number, since it is larger than the sum of its proper divisors (1227743).
125566561 is a wasteful number, since it uses less digits than its factorization.
125566561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2951.
The product of its digits is 54000, while the sum is 37.
The square root of 125566561 is about 11205.6486202272. The cubic root of 125566561 is about 500.7542762292.
The spelling of 125566561 in words is "one hundred twenty-five million, five hundred sixty-six thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •