Base | Representation |
---|---|
bin | 1001110110011001000110… |
… | …1011110100110100001100 |
3 | 1102100100021021102111011202 |
4 | 2131212101223310310030 |
5 | 2404414424011104220 |
6 | 35011132005405032 |
7 | 2165305621245260 |
oct | 235462153646414 |
9 | 42310237374152 |
10 | 10830056738060 |
11 | 34a60017649aa |
12 | 126ab30109778 |
13 | 6073681742b1 |
14 | 29626b26c0a0 |
15 | 13baabd1a275 |
hex | 9d991af4d0c |
10830056738060 has 48 divisors (see below), whose sum is σ = 25992533677824. Its totient is φ = 3713105523648.
The previous prime is 10830056738051. The next prime is 10830056738087. The reversal of 10830056738060 is 6083765003801.
It is a happy number.
10830056738060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 10830056737996 and 10830056738014.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9168587 + ... + 10282173.
It is an arithmetic number, because the mean of its divisors is an integer number (541511118288).
Almost surely, 210830056738060 is an apocalyptic number.
10830056738060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10830056738060 is an abundant number, since it is smaller than the sum of its proper divisors (15162476939764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10830056738060 is a wasteful number, since it uses less digits than its factorization.
10830056738060 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1183070 (or 1183068 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 47.
The spelling of 10830056738060 in words is "ten trillion, eight hundred thirty billion, fifty-six million, seven hundred thirty-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •