Base | Representation |
---|---|
bin | 11111110011111101110… |
… | …11010000110101100000 |
3 | 10212111100121121000022220 |
4 | 33321332323100311200 |
5 | 120402032044022411 |
6 | 2154050223431040 |
7 | 141653553354360 |
oct | 17717673206540 |
9 | 3774317530286 |
10 | 1093051157856 |
11 | 391618979049 |
12 | 157a10755480 |
13 | 7c0c7274768 |
14 | 3ac926669a0 |
15 | 1d6758deb06 |
hex | fe7eed0d60 |
1093051157856 has 96 divisors (see below), whose sum is σ = 3341024402688. Its totient is φ = 306407861760.
The previous prime is 1093051157843. The next prime is 1093051157857. The reversal of 1093051157856 is 6587511503901.
It is a tau number, because it is divible by the number of its divisors (96).
It is a junction number, because it is equal to n+sod(n) for n = 1093051157799 and 1093051157808.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1093051157857) 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, 15309330 + ... + 15380561.
It is an arithmetic number, because the mean of its divisors is an integer number (34802337528).
Almost surely, 21093051157856 is an apocalyptic number.
1093051157856 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1093051157856 is an abundant number, since it is smaller than the sum of its proper divisors (2247973244832).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1093051157856 is a wasteful number, since it uses less digits than its factorization.
1093051157856 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30689964 (or 30689956 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 51.
The spelling of 1093051157856 in words is "one trillion, ninety-three billion, fifty-one million, one hundred fifty-seven thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •