Base | Representation |
---|---|
bin | 110101111100011000… |
… | …1100111111111010001 |
3 | 102002000021212110111021 |
4 | 1223320301213333101 |
5 | 3344221241024423 |
6 | 125114551315441 |
7 | 11240460320662 |
oct | 1537061477721 |
9 | 362007773437 |
10 | 115842908113 |
11 | 45146335499 |
12 | 1a54b67bb81 |
13 | ac01b82a9a |
14 | 586d1bd369 |
15 | 303004e95d |
hex | 1af8c67fd1 |
115842908113 has 2 divisors, whose sum is σ = 115842908114. Its totient is φ = 115842908112.
The previous prime is 115842908039. The next prime is 115842908171. The reversal of 115842908113 is 311809248511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105838307584 + 10004600529 = 325328^2 + 100023^2 .
It is a cyclic number.
It is not a de Polignac number, because 115842908113 - 221 = 115840810961 is a prime.
It is a super-2 number, since 2×1158429081132 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 115842908113.
It is not a weakly prime, because it can be changed into another prime (115842908213) by changing a digit.
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 as a sum of consecutive naturals, namely, 57921454056 + 57921454057.
It is an arithmetic number, because the mean of its divisors is an integer number (57921454057).
Almost surely, 2115842908113 is an apocalyptic number.
It is an amenable number.
115842908113 is a deficient number, since it is larger than the sum of its proper divisors (1).
115842908113 is an equidigital number, since it uses as much as digits as its factorization.
115842908113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 43.
The spelling of 115842908113 in words is "one hundred fifteen billion, eight hundred forty-two million, nine hundred eight thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •