Base | Representation |
---|---|
bin | 10111011111100100010111… |
… | …011010110010111001011100 |
3 | 111112211201101120012021201211 |
4 | 113133210113122302321130 |
5 | 102020331403302440220 |
6 | 1003430330033114204 |
7 | 30522641322452041 |
oct | 2737442732627134 |
9 | 445751346167654 |
10 | 103324421140060 |
11 | 2aa1670608712a |
12 | b708b6b6b8964 |
13 | 45865b3104683 |
14 | 1b72d003911c8 |
15 | be2a8a650b5a |
hex | 5df9176b2e5c |
103324421140060 has 48 divisors (see below), whose sum is σ = 217099924991712. Its totient is φ = 41307174809600.
The previous prime is 103324421140033. The next prime is 103324421140067. The reversal of 103324421140060 is 60041124423301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103324421140067) 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, 375640980 + ... + 375915940.
It is an arithmetic number, because the mean of its divisors is an integer number (4522915103994).
Almost surely, 2103324421140060 is an apocalyptic number.
103324421140060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
103324421140060 is an abundant number, since it is smaller than the sum of its proper divisors (113775503851652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103324421140060 is a wasteful number, since it uses less digits than its factorization.
103324421140060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285174 (or 285172 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 31.
Adding to 103324421140060 its reverse (60041124423301), we get a palindrome (163365545563361).
The spelling of 103324421140060 in words is "one hundred three trillion, three hundred twenty-four billion, four hundred twenty-one million, one hundred forty thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •