Base | Representation |
---|---|
bin | 10111011111110011010011… |
… | …000110000000100110000000 |
3 | 111112220020202222012000022220 |
4 | 113133303103012000212000 |
5 | 102021112222401202012 |
6 | 1003441541032131040 |
7 | 30524046542525610 |
oct | 2737632306004600 |
9 | 445806688160286 |
10 | 103340454709632 |
11 | 2aa22493670278 |
12 | b7100a5236a80 |
13 | 4587c69b1254a |
14 | 1b739c1980a40 |
15 | be31c807808c |
hex | 5dfcd3180980 |
103340454709632 has 128 divisors (see below), whose sum is σ = 318854916384000. Its totient is φ = 29041813923840.
The previous prime is 103340454709631. The next prime is 103340454709721. The reversal of 103340454709632 is 236907454043301.
It is a tau number, because it is divible by the number of its divisors (128).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103340454709631) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 314959882 + ... + 315287817.
It is an arithmetic number, because the mean of its divisors is an integer number (2491054034250).
Almost surely, 2103340454709632 is an apocalyptic number.
103340454709632 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
103340454709632 is an abundant number, since it is smaller than the sum of its proper divisors (215514461674368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103340454709632 is an equidigital number, since it uses as much as digits as its factorization.
103340454709632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 630247784 (or 630247772 counting only the distinct ones).
The product of its (nonzero) digits is 6531840, while the sum is 51.
The spelling of 103340454709632 in words is "one hundred three trillion, three hundred forty billion, four hundred fifty-four million, seven hundred nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •