Base | Representation |
---|---|
bin | 11010001011101110111011… |
… | …011101011000011001001110 |
3 | 120002201202111201012201222000 |
4 | 122023232323131120121032 |
5 | 110043201442340331132 |
6 | 1044525413520133130 |
7 | 33153465653013033 |
oct | 3213567335303116 |
9 | 502652451181860 |
10 | 115155513214542 |
11 | 337681a7125559 |
12 | 10ab9ab04671a6 |
13 | 4c3416cba45a8 |
14 | 20617b137138a |
15 | d4a6d4a4387c |
hex | 68bbbb75864e |
115155513214542 has 32 divisors (see below), whose sum is σ = 255932551929600. Its totient is φ = 38380459353624.
The previous prime is 115155513214541. The next prime is 115155513214549. The reversal of 115155513214542 is 245412315551511.
115155513214542 is a `hidden beast` number, since 1 + 1 + 5 + 1 + 5 + 551 + 32 + 14 + 54 + 2 = 666.
It is a super-2 number, since 2×1151555132145422 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115155513214541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 130437042 + ... + 131316917.
It is an arithmetic number, because the mean of its divisors is an integer number (7997892247800).
Almost surely, 2115155513214542 is an apocalyptic number.
115155513214542 is an abundant number, since it is smaller than the sum of its proper divisors (140777038715058).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
115155513214542 is a wasteful number, since it uses less digits than its factorization.
115155513214542 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 261762117 (or 261762111 counting only the distinct ones).
The product of its digits is 600000, while the sum is 45.
The spelling of 115155513214542 in words is "one hundred fifteen trillion, one hundred fifty-five billion, five hundred thirteen million, two hundred fourteen thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •