Base | Representation |
---|---|
bin | 101111111110001111… |
… | …1100000010010110101 |
3 | 100211220122222210002101 |
4 | 1133330133200102311 |
5 | 3141441203134411 |
6 | 115154335542101 |
7 | 10304640440212 |
oct | 1377437402265 |
9 | 324818883071 |
10 | 103020364981 |
11 | 3a766346006 |
12 | 17b7138a931 |
13 | 993a4a4561 |
14 | 4db4248b09 |
15 | 2a2e4a28c1 |
hex | 17fc7e04b5 |
103020364981 has 2 divisors, whose sum is σ = 103020364982. Its totient is φ = 103020364980.
The previous prime is 103020364897. The next prime is 103020365027. The reversal of 103020364981 is 189463020301.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 100641852081 + 2378512900 = 317241^2 + 48770^2 .
It is an emirp because it is prime and its reverse (189463020301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103020364981 is a prime.
It is a super-2 number, since 2×1030203649812 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103020364981.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103020368981) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51510182490 + 51510182491.
It is an arithmetic number, because the mean of its divisors is an integer number (51510182491).
Almost surely, 2103020364981 is an apocalyptic number.
It is an amenable number.
103020364981 is a deficient number, since it is larger than the sum of its proper divisors (1).
103020364981 is an equidigital number, since it uses as much as digits as its factorization.
103020364981 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 31104, while the sum is 37.
The spelling of 103020364981 in words is "one hundred three billion, twenty million, three hundred sixty-four thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •