Base | Representation |
---|---|
bin | 10111100101001000001000… |
… | …110001001000001010110100 |
3 | 111121012020102020102020122120 |
4 | 113211020020301020022310 |
5 | 102043111230410103320 |
6 | 1004322024113355540 |
7 | 30562353643346526 |
oct | 2745101061101264 |
9 | 447166366366576 |
10 | 103706427425460 |
11 | 3005371572a412 |
12 | b76b000868bb0 |
13 | 45b36219032c2 |
14 | 1b875bc8c1a16 |
15 | bec9974d3440 |
hex | 5e5208c482b4 |
103706427425460 has 48 divisors (see below), whose sum is σ = 290390467024896. Its totient is φ = 27653859672192.
The previous prime is 103706427425401. The next prime is 103706427425593. The reversal of 103706427425460 is 64524724607301.
103706427425460 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35704564 + ... + 38499723.
It is an arithmetic number, because the mean of its divisors is an integer number (6049801396352).
Almost surely, 2103706427425460 is an apocalyptic number.
103706427425460 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103706427425460 is an abundant number, since it is smaller than the sum of its proper divisors (186684039599436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103706427425460 is a wasteful number, since it uses less digits than its factorization.
103706427425460 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 74227592 (or 74227590 counting only the distinct ones).
The product of its (nonzero) digits is 6773760, while the sum is 51.
The spelling of 103706427425460 in words is "one hundred three trillion, seven hundred six billion, four hundred twenty-seven million, four hundred twenty-five thousand, four hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •