Base | Representation |
---|---|
bin | 110000011000111110… |
… | …0001011100001111101 |
3 | 100221020011022100101011 |
4 | 1200301330023201331 |
5 | 3200310232341212 |
6 | 115423331315221 |
7 | 10336106362642 |
oct | 1406174134175 |
9 | 327204270334 |
10 | 103917074557 |
11 | 400865301aa |
12 | 1818174bb11 |
13 | 9a511b833a |
14 | 505b389dc9 |
15 | 2a8307e4a7 |
hex | 1831f0b87d |
103917074557 has 2 divisors, whose sum is σ = 103917074558. Its totient is φ = 103917074556.
The previous prime is 103917074551. The next prime is 103917074609. The reversal of 103917074557 is 755470719301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 83883219876 + 20033854681 = 289626^2 + 141541^2 .
It is an emirp because it is prime and its reverse (755470719301) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103917074557 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103917074557.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103917074551) 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, 51958537278 + 51958537279.
It is an arithmetic number, because the mean of its divisors is an integer number (51958537279).
Almost surely, 2103917074557 is an apocalyptic number.
It is an amenable number.
103917074557 is a deficient number, since it is larger than the sum of its proper divisors (1).
103917074557 is an equidigital number, since it uses as much as digits as its factorization.
103917074557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 926100, while the sum is 49.
The spelling of 103917074557 in words is "one hundred three billion, nine hundred seventeen million, seventy-four thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •