Base | Representation |
---|---|
bin | 100101001000011011000… |
… | …1100100101001011111000 |
3 | 200001212120212112002122122 |
4 | 1022100312030211023320 |
5 | 1132103110041242402 |
6 | 14504234305540412 |
7 | 1034463166541321 |
oct | 112206614451370 |
9 | 20055525462578 |
10 | 5103330415352 |
11 | 1698345a80a44 |
12 | 6a5087044708 |
13 | 2b031b875080 |
14 | 139006c5d448 |
15 | 8cb3901aca2 |
hex | 4a4363252f8 |
5103330415352 has 32 divisors (see below), whose sum is σ = 10325961660000. Its totient is φ = 2350546729344.
The previous prime is 5103330415223. The next prime is 5103330415367. The reversal of 5103330415352 is 2535140333015.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 50329727 + ... + 50431022.
It is an arithmetic number, because the mean of its divisors is an integer number (322686301875).
Almost surely, 25103330415352 is an apocalyptic number.
5103330415352 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
5103330415352 is an abundant number, since it is smaller than the sum of its proper divisors (5222631244648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5103330415352 is a wasteful number, since it uses less digits than its factorization.
5103330415352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100761255 (or 100761251 counting only the distinct ones).
The product of its (nonzero) digits is 81000, while the sum is 35.
Adding to 5103330415352 its reverse (2535140333015), we get a palindrome (7638470748367).
The spelling of 5103330415352 in words is "five trillion, one hundred three billion, three hundred thirty million, four hundred fifteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •