Base | Representation |
---|---|
bin | 110000001111111100… |
… | …1110100011000011000 |
3 | 100220110001220012212112 |
4 | 1200133321310120120 |
5 | 3144200300344220 |
6 | 115333321331452 |
7 | 10325443265654 |
oct | 1403771643030 |
9 | 326401805775 |
10 | 103614465560 |
11 | 3aa40734621 |
12 | 180b8336b88 |
13 | 9a035b5b68 |
14 | 502d0d7a64 |
15 | 2a667075c5 |
hex | 181fe74618 |
103614465560 has 32 divisors (see below), whose sum is σ = 233502069600. Its totient is φ = 41380093440.
The previous prime is 103614465547. The next prime is 103614465607. The reversal of 103614465560 is 65564416301.
103614465560 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1036144655603 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2027345 + ... + 2077824.
It is an arithmetic number, because the mean of its divisors is an integer number (7296939675).
Almost surely, 2103614465560 is an apocalyptic number.
103614465560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103614465560 is an abundant number, since it is smaller than the sum of its proper divisors (129887604040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103614465560 is a wasteful number, since it uses less digits than its factorization.
103614465560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4105811 (or 4105807 counting only the distinct ones).
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 103614465560 in words is "one hundred three billion, six hundred fourteen million, four hundred sixty-five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •