Base | Representation |
---|---|
bin | 101111100000001011… |
… | …0001111001010011111 |
3 | 100202022100021002200002 |
4 | 1133000112033022133 |
5 | 3132404343140214 |
6 | 114510252124515 |
7 | 10240635523235 |
oct | 1370026171237 |
9 | 322270232602 |
10 | 102011302559 |
11 | 3a2987a2521 |
12 | 1792b46673b |
13 | 98094134ba |
14 | 4d1a21c955 |
15 | 29c0ad11de |
hex | 17c058f29f |
102011302559 has 2 divisors, whose sum is σ = 102011302560. Its totient is φ = 102011302558.
The previous prime is 102011302469. The next prime is 102011302573. The reversal of 102011302559 is 955203110201.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102011302559 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102011302259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51005651279 + 51005651280.
It is an arithmetic number, because the mean of its divisors is an integer number (51005651280).
Almost surely, 2102011302559 is an apocalyptic number.
102011302559 is a deficient number, since it is larger than the sum of its proper divisors (1).
102011302559 is an equidigital number, since it uses as much as digits as its factorization.
102011302559 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2700, while the sum is 29.
The spelling of 102011302559 in words is "one hundred two billion, eleven million, three hundred two thousand, five hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •