Base | Representation |
---|---|
bin | 11010010000111100011000… |
… | …001011101001110110101101 |
3 | 120010222222122222201120010021 |
4 | 122100330120023221312231 |
5 | 110120033223042243000 |
6 | 1045402105351242141 |
7 | 33221402324063134 |
oct | 3220743013516655 |
9 | 503888588646107 |
10 | 115513551134125 |
11 | 33896027201851 |
12 | 10b57372679351 |
13 | 4c5bb5bb01941 |
14 | 2074c5853c91b |
15 | d54b8c58311a |
hex | 690f182e9dad |
115513551134125 has 8 divisors (see below), whose sum is σ = 144160911815544. Its totient is φ = 92410840907200.
The previous prime is 115513551134089. The next prime is 115513551134131. The reversal of 115513551134125 is 521431155315511.
It can be written as a sum of positive squares in 4 ways, for example, as 37224128940964 + 78289422193161 = 6101158^2 + 8848131^2 .
It is not a de Polignac number, because 115513551134125 - 233 = 115504961199533 is a prime.
It is a super-2 number, since 2×1155135511341252 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 462054204412 + ... + 462054204661.
It is an arithmetic number, because the mean of its divisors is an integer number (18020113976943).
Almost surely, 2115513551134125 is an apocalyptic number.
It is an amenable number.
115513551134125 is a deficient number, since it is larger than the sum of its proper divisors (28647360681419).
115513551134125 is an frugal number, since it uses more digits than its factorization.
115513551134125 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 924108409088 (or 924108409078 counting only the distinct ones).
The product of its digits is 225000, while the sum is 43.
The spelling of 115513551134125 in words is "one hundred fifteen trillion, five hundred thirteen billion, five hundred fifty-one million, one hundred thirty-four thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •