Base | Representation |
---|---|
bin | 110101101010011011… |
… | …0100110011011101111 |
3 | 102000110021211101020012 |
4 | 1223110312212123233 |
5 | 3342002444421222 |
6 | 124535102043435 |
7 | 11216521546526 |
oct | 1532466463357 |
9 | 360407741205 |
10 | 115240232687 |
11 | 4496711a528 |
12 | 1a40187957b |
13 | ab3705b4c8 |
14 | 581313b4bd |
15 | 2ee71a41e2 |
hex | 1ad4da66ef |
115240232687 has 2 divisors, whose sum is σ = 115240232688. Its totient is φ = 115240232686.
The previous prime is 115240232663. The next prime is 115240232693. The reversal of 115240232687 is 786232042511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 115240232687 - 26 = 115240232623 is a prime.
It is a super-2 number, since 2×1152402326872 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115240232647) 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, 57620116343 + 57620116344.
It is an arithmetic number, because the mean of its divisors is an integer number (57620116344).
Almost surely, 2115240232687 is an apocalyptic number.
115240232687 is a deficient number, since it is larger than the sum of its proper divisors (1).
115240232687 is an equidigital number, since it uses as much as digits as its factorization.
115240232687 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 161280, while the sum is 41.
The spelling of 115240232687 in words is "one hundred fifteen billion, two hundred forty million, two hundred thirty-two thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •