Base | Representation |
---|---|
bin | 101111111100101100… |
… | …0010011111001011101 |
3 | 100211210000201212020102 |
4 | 1133321120103321131 |
5 | 3141334321210144 |
6 | 115145232430445 |
7 | 10303434545621 |
oct | 1377130237135 |
9 | 324700655212 |
10 | 102968147549 |
11 | 3a739920303 |
12 | 17b579a8425 |
13 | 992c720a77 |
14 | 4dab335181 |
15 | 2a29adab4e |
hex | 17f9613e5d |
102968147549 has 2 divisors, whose sum is σ = 102968147550. Its totient is φ = 102968147548.
The previous prime is 102968147521. The next prime is 102968147551. The reversal of 102968147549 is 945741869201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102967183225 + 964324 = 320885^2 + 982^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102968147549 is a prime.
Together with 102968147551, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 102968147494 and 102968147503.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102968149549) 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, 51484073774 + 51484073775.
It is an arithmetic number, because the mean of its divisors is an integer number (51484073775).
Almost surely, 2102968147549 is an apocalyptic number.
It is an amenable number.
102968147549 is a deficient number, since it is larger than the sum of its proper divisors (1).
102968147549 is an equidigital number, since it uses as much as digits as its factorization.
102968147549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4354560, while the sum is 56.
The spelling of 102968147549 in words is "one hundred two billion, nine hundred sixty-eight million, one hundred forty-seven thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •