Base | Representation |
---|---|
bin | 1111000101001111001… |
… | …1000000100111001011 |
3 | 220202210101201211120101 |
4 | 3301103303000213023 |
5 | 13221121100343124 |
6 | 315010344110231 |
7 | 24501556653214 |
oct | 3612363004713 |
9 | 822711654511 |
10 | 259103918539 |
11 | 9a981452a74 |
12 | 42271465377 |
13 | 1b58322543b |
14 | c77d95840b |
15 | 6b171c1644 |
hex | 3c53cc09cb |
259103918539 has 2 divisors, whose sum is σ = 259103918540. Its totient is φ = 259103918538.
The previous prime is 259103918509. The next prime is 259103918569. The reversal of 259103918539 is 935819301952.
259103918539 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (259103918509) and next prime (259103918569).
It is a cyclic number.
It is not a de Polignac number, because 259103918539 - 215 = 259103885771 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 259103918539.
It is not a weakly prime, because it can be changed into another prime (259103918509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 129551959269 + 129551959270.
It is an arithmetic number, because the mean of its divisors is an integer number (129551959270).
Almost surely, 2259103918539 is an apocalyptic number.
259103918539 is a deficient number, since it is larger than the sum of its proper divisors (1).
259103918539 is an equidigital number, since it uses as much as digits as its factorization.
259103918539 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2624400, while the sum is 55.
The spelling of 259103918539 in words is "two hundred fifty-nine billion, one hundred three million, nine hundred eighteen thousand, five hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •