Base | Representation |
---|---|
bin | 1010000001001110111100… |
… | …0000110111111001011101 |
3 | 1110000011000022111221020121 |
4 | 2200103233000313321131 |
5 | 2420442343332134100 |
6 | 35232453212314541 |
7 | 2214621223045423 |
oct | 240235700677135 |
9 | 43004008457217 |
10 | 11016306130525 |
11 | 3567a97686143 |
12 | 129b04a772a51 |
13 | 61baaa7435b7 |
14 | 2a1299035113 |
15 | 14185cec051a |
hex | a04ef037e5d |
11016306130525 has 12 divisors (see below), whose sum is σ = 13852617063264. Its totient is φ = 8688917510000.
The previous prime is 11016306130519. The next prime is 11016306130537. The reversal of 11016306130525 is 52503160361011.
It is not a de Polignac number, because 11016306130525 - 241 = 8817282874973 is a prime.
It is a super-2 number, since 2×110163061305252 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3103183051 + ... + 3103186600.
It is an arithmetic number, because the mean of its divisors is an integer number (1154384755272).
Almost surely, 211016306130525 is an apocalyptic number.
It is an amenable number.
11016306130525 is a deficient number, since it is larger than the sum of its proper divisors (2836310932739).
11016306130525 is an equidigital number, since it uses as much as digits as its factorization.
11016306130525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6206369732 (or 6206369727 counting only the distinct ones).
The product of its (nonzero) digits is 16200, while the sum is 34.
Adding to 11016306130525 its reverse (52503160361011), we get a palindrome (63519466491536).
The spelling of 11016306130525 in words is "eleven trillion, sixteen billion, three hundred six million, one hundred thirty thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •