Base | Representation |
---|---|
bin | 110000010001001100… |
… | …1110111011111011101 |
3 | 100220112222211210101100 |
4 | 1200202121313133131 |
5 | 3144242020440331 |
6 | 115341420503313 |
7 | 10326463021014 |
oct | 1404231673735 |
9 | 326488753340 |
10 | 103656421341 |
11 | 3aa62390620 |
12 | 1810a3aab39 |
13 | 9a0c1b5975 |
14 | 50348d9a7b |
15 | 2a6a243ae6 |
hex | 18226777dd |
103656421341 has 12 divisors (see below), whose sum is σ = 163337391360. Its totient is φ = 62822073480.
The previous prime is 103656421303. The next prime is 103656421343. The reversal of 103656421341 is 143124656301.
103656421341 is a `hidden beast` number, since 1 + 0 + 3 + 6 + 5 + 642 + 1 + 3 + 4 + 1 = 666.
It is a de Polignac number, because none of the positive numbers 2k-103656421341 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 103656421296 and 103656421305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103656421343) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 523517181 + ... + 523517378.
It is an arithmetic number, because the mean of its divisors is an integer number (13611449280).
Almost surely, 2103656421341 is an apocalyptic number.
103656421341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
103656421341 is a deficient number, since it is larger than the sum of its proper divisors (59680970019).
103656421341 is a wasteful number, since it uses less digits than its factorization.
103656421341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1047034576 (or 1047034573 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
The spelling of 103656421341 in words is "one hundred three billion, six hundred fifty-six million, four hundred twenty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •