Base | Representation |
---|---|
bin | 101111111101111011… |
… | …1110011100001000101 |
3 | 100211212221102001100001 |
4 | 1133323313303201011 |
5 | 3141431022123312 |
6 | 115153324521301 |
7 | 10304453124064 |
oct | 1377367634105 |
9 | 324787361301 |
10 | 103009957957 |
11 | 3a760488065 |
12 | 17b699b0231 |
13 | 993829c65a |
14 | 4db2ada1db |
15 | 2a2d5e9057 |
hex | 17fbdf3845 |
103009957957 has 2 divisors, whose sum is σ = 103009957958. Its totient is φ = 103009957956.
The previous prime is 103009957933. The next prime is 103009957987. The reversal of 103009957957 is 759759900301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 78759370881 + 24250587076 = 280641^2 + 155726^2 .
It is an emirp because it is prime and its reverse (759759900301) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 103009957957 - 215 = 103009925189 is a prime.
It is a super-2 number, since 2×1030099579572 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 103009957898 and 103009957907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103009957987) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51504978978 + 51504978979.
It is an arithmetic number, because the mean of its divisors is an integer number (51504978979).
Almost surely, 2103009957957 is an apocalyptic number.
It is an amenable number.
103009957957 is a deficient number, since it is larger than the sum of its proper divisors (1).
103009957957 is an equidigital number, since it uses as much as digits as its factorization.
103009957957 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2679075, while the sum is 55.
The spelling of 103009957957 in words is "one hundred three billion, nine million, nine hundred fifty-seven thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •