Base | Representation |
---|---|
bin | 1001100011010111111100… |
… | …1000100110101100001100 |
3 | 1101012002220222122220220001 |
4 | 2120311333020212230030 |
5 | 2334041303432011110 |
6 | 34201055014534044 |
7 | 2132561154640066 |
oct | 230657710465414 |
9 | 41162828586801 |
10 | 10503328000780 |
11 | 338a48892078a |
12 | 1217747367324 |
13 | 5b25c8910614 |
14 | 28451433a736 |
15 | 133337d0a63a |
hex | 98d7f226b0c |
10503328000780 has 24 divisors (see below), whose sum is σ = 22271134328352. Its totient is φ = 4160541576192.
The previous prime is 10503328000771. The next prime is 10503328000817. The reversal of 10503328000780 is 8700082330501.
10503328000780 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×105033280007802 (a number of 27 digits) contains 22 as substring.
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, 2549349397 + ... + 2549353516.
It is an arithmetic number, because the mean of its divisors is an integer number (927963930348).
Almost surely, 210503328000780 is an apocalyptic number.
10503328000780 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10503328000780 is an abundant number, since it is smaller than the sum of its proper divisors (11767806327572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10503328000780 is a wasteful number, since it uses less digits than its factorization.
10503328000780 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5098703025 (or 5098703023 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 37.
The spelling of 10503328000780 in words is "ten trillion, five hundred three billion, three hundred twenty-eight million, seven hundred eighty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •