Base | Representation |
---|---|
bin | 1010011010100100001101… |
… | …0000001000011100101001 |
3 | 1111112202100111110201222020 |
4 | 2212221003100020130221 |
5 | 3000110143321113023 |
6 | 40204430201415053 |
7 | 2261226056263002 |
oct | 246510320103451 |
9 | 44482314421866 |
10 | 11451511113513 |
11 | 37156165352a9 |
12 | 134b467a9a489 |
13 | 650b468b5a03 |
14 | 2b8382a221a9 |
15 | 14cd30439de3 |
hex | a6a43408729 |
11451511113513 has 16 divisors (see below), whose sum is σ = 15312264101376. Its totient is φ = 7612556515200.
The previous prime is 11451511113467. The next prime is 11451511113529. The reversal of 11451511113513 is 31531111515411.
It is not a de Polignac number, because 11451511113513 - 238 = 11176633206569 is a prime.
It is a super-2 number, since 2×114515111135132 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11451511113593) 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 15 ways as a sum of consecutive naturals, for example, 5609256 + ... + 7373382.
It is an arithmetic number, because the mean of its divisors is an integer number (957016506336).
Almost surely, 211451511113513 is an apocalyptic number.
It is an amenable number.
11451511113513 is a deficient number, since it is larger than the sum of its proper divisors (3860752987863).
11451511113513 is a wasteful number, since it uses less digits than its factorization.
11451511113513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1770304.
The product of its digits is 4500, while the sum is 33.
Adding to 11451511113513 its reverse (31531111515411), we get a palindrome (42982622628924).
The spelling of 11451511113513 in words is "eleven trillion, four hundred fifty-one billion, five hundred eleven million, one hundred thirteen thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •