Base | Representation |
---|---|
bin | 110000001110001110… |
… | …1000110100010111001 |
3 | 100220022001000122122221 |
4 | 1200130131012202321 |
5 | 3144040442344022 |
6 | 115323453244041 |
7 | 10324141425415 |
oct | 1403435064271 |
9 | 326261018587 |
10 | 103556606137 |
11 | 3aa11005a16 |
12 | 180a0a93621 |
13 | 99c460830a |
14 | 5025555d45 |
15 | 2a615c8cc7 |
hex | 181c7468b9 |
103556606137 has 16 divisors (see below), whose sum is σ = 109204200000. Its totient is φ = 98049375424.
The previous prime is 103556606117. The next prime is 103556606161. The reversal of 103556606137 is 731606655301.
It is a cyclic number.
It is not a de Polignac number, because 103556606137 - 211 = 103556604089 is a prime.
It is a super-3 number, since 3×1035566061373 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 103556606093 and 103556606102.
It is not an unprimeable number, because it can be changed into a prime (103556606107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3210114 + ... + 3242212.
It is an arithmetic number, because the mean of its divisors is an integer number (6825262500).
Almost surely, 2103556606137 is an apocalyptic number.
It is an amenable number.
103556606137 is a deficient number, since it is larger than the sum of its proper divisors (5647593863).
103556606137 is a wasteful number, since it uses less digits than its factorization.
103556606137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34280.
The product of its (nonzero) digits is 340200, while the sum is 43.
The spelling of 103556606137 in words is "one hundred three billion, five hundred fifty-six million, six hundred six thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •