Base | Representation |
---|---|
bin | 10101000100010010… |
… | …11001000011110101 |
3 | 1002012020100001101122 |
4 | 22202021121003311 |
5 | 141130414234100 |
6 | 5110151033325 |
7 | 550165003451 |
oct | 124211310365 |
9 | 32166301348 |
10 | 11310305525 |
11 | 4884410a42 |
12 | 223796b845 |
13 | 10b32c309c |
14 | 7941a7661 |
15 | 462e36985 |
hex | 2a22590f5 |
11310305525 has 6 divisors (see below), whose sum is σ = 14024778882. Its totient is φ = 9048244400.
The previous prime is 11310305519. The next prime is 11310305533. The reversal of 11310305525 is 52550301311.
It is a happy number.
It can be written as a sum of positive squares in 3 ways, for example, as 1102638436 + 10207667089 = 33206^2 + 101033^2 .
It is not a de Polignac number, because 11310305525 - 24 = 11310305509 is a prime.
It is a super-2 number, since 2×113103055252 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11310305494 and 11310305503.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 226206086 + ... + 226206135.
It is an arithmetic number, because the mean of its divisors is an integer number (2337463147).
Almost surely, 211310305525 is an apocalyptic number.
It is an amenable number.
11310305525 is a deficient number, since it is larger than the sum of its proper divisors (2714473357).
11310305525 is an equidigital number, since it uses as much as digits as its factorization.
11310305525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 452412231 (or 452412226 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 11310305525 its reverse (52550301311), we get a palindrome (63860606836).
The spelling of 11310305525 in words is "eleven billion, three hundred ten million, three hundred five thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •