Base | Representation |
---|---|
bin | 11010001100111110000110… |
… | …111111100111010011110101 |
3 | 120010000212221211200220110201 |
4 | 122030332012333213103311 |
5 | 110101100102234421010 |
6 | 1045032434131120501 |
7 | 33162565551455230 |
oct | 3214760677472365 |
9 | 503025854626421 |
10 | 115240532342005 |
11 | 337a0265213364 |
12 | 10b12479143131 |
13 | 4c3c19bb041c5 |
14 | 206595894a417 |
15 | d4ca0d99623a |
hex | 68cf86fe74f5 |
115240532342005 has 32 divisors (see below), whose sum is σ = 168231511353600. Its totient is φ = 74021864919552.
The previous prime is 115240532342003. The next prime is 115240532342051. The reversal of 115240532342005 is 500243235042511.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 115240532342005 - 21 = 115240532342003 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (115240532342003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 973502802 + ... + 973621171.
It is an arithmetic number, because the mean of its divisors is an integer number (5257234729800).
Almost surely, 2115240532342005 is an apocalyptic number.
It is an amenable number.
115240532342005 is a deficient number, since it is larger than the sum of its proper divisors (52990979011595).
115240532342005 is a wasteful number, since it uses less digits than its factorization.
115240532342005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1947124093.
The product of its (nonzero) digits is 144000, while the sum is 37.
Adding to 115240532342005 its reverse (500243235042511), we get a palindrome (615483767384516).
The spelling of 115240532342005 in words is "one hundred fifteen trillion, two hundred forty billion, five hundred thirty-two million, three hundred forty-two thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •