Base | Representation |
---|---|
bin | 101111100010000110… |
… | …0001011111111111011 |
3 | 100202110211120202000001 |
4 | 1133010030023333323 |
5 | 3133022344331034 |
6 | 114520514053431 |
7 | 10242350534356 |
oct | 1370414137773 |
9 | 322424522001 |
10 | 102075777019 |
11 | 3a32112a0a7 |
12 | 17948b7a277 |
13 | 9819898c78 |
14 | 4d24a0329d |
15 | 29c65b9a14 |
hex | 17c430bffb |
102075777019 has 2 divisors, whose sum is σ = 102075777020. Its totient is φ = 102075777018.
The previous prime is 102075777017. The next prime is 102075777077. The reversal of 102075777019 is 910777570201.
It is a weak prime.
It is an emirp because it is prime and its reverse (910777570201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102075777019 - 21 = 102075777017 is a prime.
It is a super-2 number, since 2×1020757770192 (a number of 23 digits) contains 22 as substring.
Together with 102075777017, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 102075777019.
It is not a weakly prime, because it can be changed into another prime (102075777017) 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, 51037888509 + 51037888510.
It is an arithmetic number, because the mean of its divisors is an integer number (51037888510).
Almost surely, 2102075777019 is an apocalyptic number.
102075777019 is a deficient number, since it is larger than the sum of its proper divisors (1).
102075777019 is an equidigital number, since it uses as much as digits as its factorization.
102075777019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216090, while the sum is 46.
The spelling of 102075777019 in words is "one hundred two billion, seventy-five million, seven hundred seventy-seven thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •