Base | Representation |
---|---|
bin | 10101101011110001… |
… | …00001011100001101 |
3 | 1010001022101210122211 |
4 | 22311320201130031 |
5 | 142320201141400 |
6 | 5203100110421 |
7 | 561325334344 |
oct | 126570413415 |
9 | 33038353584 |
10 | 11641427725 |
11 | 4a34311a54 |
12 | 230a835411 |
13 | 1136a99895 |
14 | 7c615cb5b |
15 | 482041dba |
hex | 2b5e2170d |
11641427725 has 12 divisors (see below), whose sum is σ = 14540742324. Its totient is φ = 9245160320.
The previous prime is 11641427723. The next prime is 11641427731. The reversal of 11641427725 is 52772414611.
11641427725 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 1399582921 + 10241844804 = 37411^2 + 101202^2 .
It is not a de Polignac number, because 11641427725 - 21 = 11641427723 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11641427723) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 1696054 + ... + 1702903.
It is an arithmetic number, because the mean of its divisors is an integer number (1211728527).
Almost surely, 211641427725 is an apocalyptic number.
It is an amenable number.
11641427725 is a deficient number, since it is larger than the sum of its proper divisors (2899314599).
11641427725 is a wasteful number, since it uses less digits than its factorization.
11641427725 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3399104 (or 3399099 counting only the distinct ones).
The product of its digits is 94080, while the sum is 40.
The spelling of 11641427725 in words is "eleven billion, six hundred forty-one million, four hundred twenty-seven thousand, seven hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •