Base | Representation |
---|---|
bin | 11010001100100001111101… |
… | …110010011100100100110101 |
3 | 120002220222221210220120201202 |
4 | 122030201331302130210311 |
5 | 110100101210124433044 |
6 | 1045010515344302245 |
7 | 33160445650401245 |
oct | 3214417562344465 |
9 | 502828853816652 |
10 | 115210313124149 |
11 | 33789468260751 |
12 | 10b08644911985 |
13 | 4c393941b66c9 |
14 | 20642cd359b25 |
15 | d4bd409b8c4e |
hex | 68c87dc9c935 |
115210313124149 has 8 divisors (see below), whose sum is σ = 122314434315480. Its totient is φ = 108142530149376.
The previous prime is 115210313124139. The next prime is 115210313124187. The reversal of 115210313124149 is 941421313012511.
It can be written as a sum of positive squares in 4 ways, for example, as 10266372157924 + 104943940966225 = 3204118^2 + 10244215^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 115210313124149 - 24 = 115210313124133 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115210313124139) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9084547604 + ... + 9084560285.
It is an arithmetic number, because the mean of its divisors is an integer number (15289304289435).
Almost surely, 2115210313124149 is an apocalyptic number.
It is an amenable number.
115210313124149 is a deficient number, since it is larger than the sum of its proper divisors (7104121191331).
115210313124149 is a wasteful number, since it uses less digits than its factorization.
115210313124149 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18169108279.
The product of its (nonzero) digits is 25920, while the sum is 38.
The spelling of 115210313124149 in words is "one hundred fifteen trillion, two hundred ten billion, three hundred thirteen million, one hundred twenty-four thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •