Base | Representation |
---|---|
bin | 110101100100100010… |
… | …1000011001000101111 |
3 | 101222221112010100122122 |
4 | 1223021011003020233 |
5 | 3341101412144204 |
6 | 124503324103155 |
7 | 11211602522204 |
oct | 1531105031057 |
9 | 358845110578 |
10 | 115042693679 |
11 | 44875668551 |
12 | 1a367694abb |
13 | ab05156414 |
14 | 57d4bd9cab |
15 | 2ed4b840be |
hex | 1ac914322f |
115042693679 has 2 divisors, whose sum is σ = 115042693680. Its totient is φ = 115042693678.
The previous prime is 115042693651. The next prime is 115042693687. The reversal of 115042693679 is 976396240511.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 115042693679 - 224 = 115025916463 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 115042693679.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (115042693279) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57521346839 + 57521346840.
It is an arithmetic number, because the mean of its divisors is an integer number (57521346840).
Almost surely, 2115042693679 is an apocalyptic number.
115042693679 is a deficient number, since it is larger than the sum of its proper divisors (1).
115042693679 is an equidigital number, since it uses as much as digits as its factorization.
115042693679 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2449440, while the sum is 53.
The spelling of 115042693679 in words is "one hundred fifteen billion, forty-two million, six hundred ninety-three thousand, six hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •