Base | Representation |
---|---|
bin | 10100100011000101… |
… | …00110100000010101 |
3 | 1001110211002111112222 |
4 | 22101202212200111 |
5 | 140043103422100 |
6 | 5022355352125 |
7 | 540242626055 |
oct | 122142464025 |
9 | 31424074488 |
10 | 11031701525 |
11 | 47511206a9 |
12 | 217a5b2645 |
13 | 106a676c50 |
14 | 7691a3565 |
15 | 448752485 |
hex | 2918a6815 |
11031701525 has 12 divisors (see below), whose sum is σ = 14731564932. Its totient is φ = 8146487040.
The previous prime is 11031701503. The next prime is 11031701543. The reversal of 11031701525 is 52510713011.
It can be written as a sum of positive squares in 6 ways, for example, as 300606244 + 10731095281 = 17338^2 + 103591^2 .
It is not a de Polignac number, because 11031701525 - 28 = 11031701269 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11031701494 and 11031701503.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16971524 + ... + 16972173.
It is an arithmetic number, because the mean of its divisors is an integer number (1227630411).
Almost surely, 211031701525 is an apocalyptic number.
It is an amenable number.
11031701525 is a deficient number, since it is larger than the sum of its proper divisors (3699863407).
11031701525 is a wasteful number, since it uses less digits than its factorization.
11031701525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33943720 (or 33943715 counting only the distinct ones).
The product of its (nonzero) digits is 1050, while the sum is 26.
The spelling of 11031701525 in words is "eleven billion, thirty-one million, seven hundred one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •