Base | Representation |
---|---|
bin | 1010011110001010000001… |
… | …1101100010011011101111 |
3 | 1111202122121000101000010201 |
4 | 2213202200131202123233 |
5 | 3002113020314413210 |
6 | 40253032040014331 |
7 | 2265541640063566 |
oct | 247424035423357 |
9 | 44678530330121 |
10 | 11513204451055 |
11 | 37397a484497a |
12 | 135b404a613a7 |
13 | 6568c90c8a78 |
14 | 2bb356344bdd |
15 | 14e74167753a |
hex | a78a07626ef |
11513204451055 has 16 divisors (see below), whose sum is σ = 13894684876800. Its totient is φ = 9158087907360.
The previous prime is 11513204451031. The next prime is 11513204451083. The reversal of 11513204451055 is 55015440231511.
It is not a de Polignac number, because 11513204451055 - 233 = 11504614516463 is a prime.
It is a super-2 number, since 2×115132044510552 (a number of 27 digits) contains 22 as substring.
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 15 ways as a sum of consecutive naturals, for example, 4155535 + ... + 6347824.
It is an arithmetic number, because the mean of its divisors is an integer number (868417804800).
Almost surely, 211513204451055 is an apocalyptic number.
11513204451055 is a deficient number, since it is larger than the sum of its proper divisors (2381480425745).
11513204451055 is a wasteful number, since it uses less digits than its factorization.
11513204451055 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10504614.
The product of its (nonzero) digits is 60000, while the sum is 37.
Adding to 11513204451055 its reverse (55015440231511), we get a palindrome (66528644682566).
The spelling of 11513204451055 in words is "eleven trillion, five hundred thirteen billion, two hundred four million, four hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •